約 6,237,667 件
https://w.atwiki.jp/bfgmatome/pages/416.html
ゲーム情報（登録されているタグ） シリーズ＞Enlightenus ジャンル＞アイテム探し ジャンル＞アドベンチャー ジャンル＞コレクターズエディション ジャンル＞パズル 製作会社＞Blue Tea Games 製作会社＞未確認 言語＞英語 コメント欄へ移動 ゲーム配布ページ 英語 http //www.bigfishgames.com/download-games/8957/enlightenus-the-timeless-tower/index.html http //www.bigfishgames.com/download-games/8835/enlightenus-ii-timeless-tower-collectors/index.html 日本語 紹介文 Clarence Flatt, an expert clockmaker, has asked for your help and has offered you the chance to explore the legendary Timeless Tower! While working on the incredible Ageless Clock, something goes wrong and pieces of the device end up all over the Timeless Tower. These pieces begin to unravel the very fabric of time, and only you can set things right in Enlightenus II The Timeless Tower, a fun Hidden Object Puzzle Adventure game. Fantastic gameplay Explore the Timeless Tower! For a more in depth experience, check out the Collector s Edition Get the Strategy Guide! Check out our Blog Walkthrough The Collector’s Edition includes Bonus gameplay quest Built in Strategy Guide Fun Achievements Sneak peek of Enlightenus 3 Full version of Forgotten Riddles Mayan Princess 画像 « » var ppvArray_0_509fe417cf9378b54280cbf5cb045102 = new Array(); ppvArray_0_509fe417cf9378b54280cbf5cb045102[0] = http //w.atwiki.jp/bfgmatome/?cmd=upload&act=open&page=Enlightenus+II%3A+The+Timeless+Tower&file=en_enlightenus-ii-timeless-tower-collectors-screen1.jpg ; window.onload=function(){ ppvShow_0_509fe417cf9378b54280cbf5cb045102(0); }; function ppvShow_0_509fe417cf9378b54280cbf5cb045102(n){ if(!ppvArray_0_509fe417cf9378b54280cbf5cb045102[n]){ alert( 画像がありません ); return; } ppv_0_509fe417cf9378b54280cbf5cb045102$( ppv_img_0_509fe417cf9378b54280cbf5cb045102 ).src=ppvArray_0_509fe417cf9378b54280cbf5cb045102[n]; ppv_0_509fe417cf9378b54280cbf5cb045102$( ppv_link_0_509fe417cf9378b54280cbf5cb045102 ).href=ppvArray_0_509fe417cf9378b54280cbf5cb045102[n]; ppv_0_509fe417cf9378b54280cbf5cb045102$( ppv_prev_0_509fe417cf9378b54280cbf5cb045102 ).href= javascript ppvShow_0_509fe417cf9378b54280cbf5cb045102( +(n-1)+ ) ; ppv_0_509fe417cf9378b54280cbf5cb045102$( ppv_next_0_509fe417cf9378b54280cbf5cb045102 ).href= javascript ppvShow_0_509fe417cf9378b54280cbf5cb045102( +(n+1)+ ) ; } function ppv_0_509fe417cf9378b54280cbf5cb045102$(){ var elements = new Array(); for (var i = 0; i arguments.length; i++){ var element = arguments[i]; if (typeof element == string ) element = document.getElementById(element); if (arguments.length == 1) return element; elements.push(element); } return elements; } 備考 レス一覧 505 名前： 名無しさんの野望 [sage] 投稿日： 2010/08/05(木) 19 05 06 ID m9ZXWaub Enlightenus IIキター・・・けどＣＥ orz しかもフルバージョンのForgotten Riddles Mayan Princessがオマケって もう持ってるんですけど、どうしろとｗ 816 名前： 名無しさんの野望 [sage] 投稿日： 2010/09/12(日) 14 46 41 ID gjY4X400 お姫様の開発者レコードを塗り替えられない・・・ けれど、旗は確実にとれるようになったので、ちょっと疲れた 何かアイテム探し系でおﾇﾇﾒを教えていただけたらうれしいです。 ストーリーが凝っているもの、あまりパズルが難解でないものが 好きです（レブンは、嫌いだった）。トライアルでは眠り姫かダビンチが 面白かったのですが、・・・皆さんのご意見おしえてください。 米サイトでクレジット買ってスタンバイしております。 817 名前： 名無しさんの野望 [sage] 投稿日： 2010/09/12(日) 15 07 35 ID 3HloT8uS アイテム探しのおすすめというか比較的サクサクできてあんまり怖くない系で 最近３か月以内の新作(英語版)で自分がおもしろかったものは、 「Enlightenus II The Timeless Tower」(一階毎クリアで目標が明確) 「Secrets of the Dragon Wheel」(主人公になった気分で楽しめた) 「Nemo s Secret The Nautilus」(短目で多少あっさり) 「Dark Tales Edgar Allan Poe s The Black Cat」(ホラー風味だけど大丈夫) Gamezeboのサイトで、Hidden Objectのuser top rated(90 days)で４以上のは 大体おもしろいと思うけど、「Nightfall Mysteries Asylum Conspiracy」とか 「Redrum Time Lies」とかは自分には怖すぎてやってないんで分かりません。 コメント 名前 コメント トップページに戻る
https://w.atwiki.jp/stones/pages/339.html
CDR 001 - DEMO RECORDING SESSIONS 1962 (16 49) 1 Little Queenie (demo) 2 Beautiful Delilah (demo) 3 Down The Road Apiece (demo) 4 I Aint Got You (demo) 5 Don t Want No Woman (demo) 6 Around Around (demo) 7 Little Queenie/Beautiful Delilah/La Bamba/Wee Baby Blues (On Your Way To School)/Around Around (demo) 8 You Can t Judge A Book By Looking At The Cover (part) (demo) ■Bill Wyman s Black Box (VGP-329) includes tracks 1-4 mono ■Down The Road Apiece (Bad Wizard BW 6167) includes tracks 5-6 mono ■Reelin Rockin (VGP-274) includes track 7 mono ■Around Around (Invasion Unlimited IU9531-1) includes track 8 mono Note; Dartford, Kent, late 1961 or early 1962 (tracks 1-7), Curly Clayton Sound Studio, London, 10.27.1962 (track 8) CDR 002 - FIRST RECORDING SESSIONS 1963 (50 36) 1 Road Runner (demo) 2 Diddley Daddy (demo) 3 I Want To Be Loved (demo) 4 Baby What s Wrong (demo) 5 Bright Lights, Big City (demo) 6 Come On (7"single) 7 I Want To Be Loved (7"single) 8 Fortune Teller (saturday club) 9 Poison Ivy (long take) (saturday club) 10 Bye Bye Johnny (EP the rolling stones) 11 You Better Move On (EP the rolling stones) 12 I Wanna Be Your Man (7"single) 13 Stoned (7"single) 14 Come On (BBC) 15 Memphis, Tennessee (BBC) 16 Roll Over Beethoven (BBC) 17 Money (EP the rolling stones) 18 Poison Ivy (short take) (EP the rolling stones) 19 Go Home, Girl (outtake) 20 That s Girl Belongs To Yesterday (outtake) 21 Leave Me Alone (outtake) 22 It Should Be You (outtake) ■IBC Demos 1963 (The Swingin Pig TSP-CDS-001) includes tracks 1-5 mono ■SINGLES COLLECTION / THE LONDON YEARS (abkco 92312) includes tracks 6-7,12-13 mono ■MORE HOT ROCKS (abkco 96262) includes tracks 8-10,17-18 mono ■DECEMBER S CHILDREN (abkco 94512) includes track 11 mono ■Get Satisfaction...If You Want ! (The Swingin Pig TSP-CD-003) includes tracks 14-16 mono ■Time Trip Vol. 5 (Scorpio TT5) includes track 19-22 mono Note; IBC Studios, London, 3.11.1963 (tracks 1-5), Olympic Sound Studios, London, 5.10.1963 (tracks 6-7), Decca Studios, London, 7.9.1963 (track 8), 7.16.1963 (track 9), 8.8.1963 (tracks 10-11), Saturday Club, BBC Radio, London, 10.26.1963 (tracks 14-16), De Lane Lea Music Recording Studios, London, 10.7.1963 (tracks 12-13) 11.14.1963 (tracks 17-19), Regent Sound Studios, London, 11.20-21.1963 (tracks 20-22) CDR 003 - THE ROLLING STONES SESSIONS 1964 (40 37) 1 Not Fade Away (outtake) 2 I m A King Bee (backing track) 3 Not Fade Away (7"single) 4 Little By Little (7"single) 5 Mr. Spector Mr. Pitney Come Too (outtake) 6 Andrew s Blues (outtake) 7 Wake Up In The Morning (jingle for kellog s rise krispies) 8 Tell Me (You re Coming Back) (outtake) 9 Tell Me (You re Coming Back) (UK LP full length version) 10 Good Times, Bad Times (7"single) 11 As Time Goes By (outtake) 12 Route 66 (BBC) 13 Cops Robbers (BBC) 14 You Better Move On (BBC) 15 Mona (I Need You Baby) (BBC) 16 Don t Lie To Me (outtake) ■The Black Box CD-1 (Yellow Dog YD 046) includes tracks 1,11 mono ■Record Mirror Volume 1 / 1962-1968 (Bedrock Records) includes track 2 mono ■SINGLES COLLECTION / THE LONDON YEARS (abkco 92312) includes tracks 3-4,10 mono ■Necrophilia (VGP-317) includes tracks 5-6 mono ■The Rolling Stones No.2 (bootleg) includes track 7 mono ■Bright Lights Big City (VGP-307) includes track 8 mono ■THE ROLLING STONES (London P25L 25031) includes track 9 mono ■Comden Thatre 1964 (The Swingin Pig TSP-CDS-004) includes tracks 12-15 stereo ■METAMORPHOSIS (abkko 90062) includes track 16 stereo Note; Regent Sound Studios, London, 1.10.1964 (tracks 1-2), 1.28-29.1964 (tracks 3),2.4.1964 (Tracks 4-6), 2.24-25.1964 (tracks 8-10), 5.12.1964 (track 16), Pye Studios, London, 2.6.1964 (track 7), De Lane Lea Music Recording Studios, London, 3.11.1964 (track 11), Blues in Rhythm, BBC Radio, London, 3.19.1964 (tracks 12-15) CDR 004 - CHESS RECORDING SESSIONS 1964 (41 56) 1 It s All Over Now (stereo version) 2 I Can t Be Satisfied (stereo version) 3 Stewed Keefed (outtake) 4 Confenssin The Blues (stereo version) 5 Around Around (stereo version) 6 Look What You ve Down (stereo version) 7 Down The Road Apiece (stereo version) 8 If You Need Me (stereo version) 9 Hi-Heel Sneakers (outtake) 10 Meet Me In The Bottom (outtake) 11 Empty Heart (stereo version) 12 Tell Me Baby, How Many More Time (outtake) 13 2120 South Michigan Avenue (full length stereo version) 14 Reelin Rockin (outtake) ■12X5 (abkco 94022) includes tracks 1, 4, 5, 8,11,13 stereo ■MORE HOT ROCKS (abkco 96262) includes track 2 stereo ■The Black Box CD-1 (Yellow Dog YD 046) includes tracks 3, 9-10,12 stereo ■DECEMBER S CHILDREN (abkco 94512) includes track 6 stereo ■THE ROLLING STONES, NOW! (abkco 94202) includes track 7 stereo ■Reelin Rockin (VGP-274) includes track 14 mono Note; Chess Studios, Chicago, Illinois, 6.10.1964 (tracks 1-3), 6.11.1964 (tracks 4-14) CDR 005 - RECORDING SESSIONS FOR ANDREW OLDHAM 1964 (44 54) 1 Some Things Just Stick In Your Mind (basic track) 2 Some Things Just Stick In Your Mind (additional pedal steel guitar) 3 Try A Little Harder (basic track) 4 Try A Little Harder (additional brass backing vocals) 5 Heart Of Stone (basic track) 6 Heart Of Stone (additional pedal steel guitar) 7 Blue Turns To Grey (basic track) 8 Blue Turns To Grey (additional female backing vocals) 9 Earch Every Day Of The Year (basic track) 10 Earch Every Day Of The Year (additional female backing vocals, brass strings) 11 (Walkin Thru The) Sleepy City (basic track) 12 (Walkin Thru The) Sleepy City 13 We re Wastin Time (basic track) 14 We re Wastin Time (additional pedal steel guitar fiddle) 15 I d Much Rather Be With The Boys (basic track) 16 I d Much Rather Be With The Boys (additional backing vocals pedal steel guitar) ■The Black Box CD-1 (Yellow Dog YD 046) includes tracks 1, 3, 7,11,13 mono ■METAMORPHOSIS (abkko 90062) includes tracks 2, 4, 6,10,12,14,16 stereo ■The Allen Klein Collection / Kleins Revenge (Midnight Beat MBCD 128) includes tracks 5, 9,15 mono ■Necrophilia (VGP-317) includes track 8 stereo Note; Regent Sound Studios, London, 2.13.1964 (tracks 1, 3), 6.29-7.7.1964 (tracks 2, 4), 7.21-23.1964 (tracks 5-6), 8.31-9.4.1964 (tracks 7-14), Decca Studios, London, 2.1965 (tracks 15-16) CDR 006 - THE ROLLING STONES NO.2 SESSIONS 1964 (34 42) 1 Little Red Rooster (7"single) 2 Off The Hook (7"single) 3 Susie Q (with count version) 4 Surprise, Surprise (fourteen) 5 We Were Falling In Love (Waving Hair) (outtake) 6 Everybody Needs Somebody To Love (long take-stereo version) 7 Heart Of Stone (stereo long version) 8 Time Is On My Side (guitar intro take-stereo version) 9 What A Shame (stereo version) 10 Mercy, Mercy (outtake) 11 Good Bye Girl (outtake) 12 Key To The Highway (outtake) ■SINGLES COLLECTION / THE LONDON YEARS (abkco 92312) includes tracks 1-2 mono ■Time Trip Vol. 5 (Scorpio TT5) includes tracks 3,10-12 mono, track 7 stereo ■THE ROLLING STONES, NOW! (abkco 94202) includes track 4 mono, track 9 stereo ■Bill Wyman s Black Box (VGP-329) includes track 5 mono ■Bright Lights Big City (VGP-307) includes track 6 stereo ■HOT ROCKS 1964-1971 (abkco 96672) includes track 8 stereo Note; Regent Sound Studios, London, 9.2.1964 (tracks 1-2), 9.28-29.1964 (tracks 3-5), RCA Studios, Los Angeles, California, 11.2.1964 (tracks 6-7), Chess Studios, Chicago, Illinois, 11.8.1964 (tracks 8-12) CDR 007 - OUT OF OUR HEADS SESSIONS 1965 (42 01) 1 The Last Time (stereo version) 2 Play With Fire (stereo version) 3 The Under Assistant Westcoast Promotion Man (full length version) 4 (I Cant Get No) Satisfaction (backing track) 5 The Spider The Fly (backing track) 6 (I Cant Get No) Satisfaction (stereo version 1) 7 (I Cant Get No) Satisfaction (stereo version 2 acoustic guitar only) 8 The Spider The Fly (7"single) 9 Good Times (additional female backing vocals) 10 I ve Been Loving You Too Long (studio take) 11 Get Off Of My Cloud (stereo version) 12 The Singer Not The Song (stereo version) 13 Looking Tired (outtake) 14 As Tears Go By (7"single) ■Time Trip Vol. 5 (Scorpio TT5) includes track 1 stereo ■HOT ROCKS 1 (London 820141) includes tracks 2, 6,11 stereo ■SINGLES COLLECTION / THE LONDON YEARS (abkco 1218-2) includes track 3 mono ■The Black Box CD-1 (Yellow Dog YD 046) includes track 4 mono, track 13 stereo ■Ultra Rare Trax Vol. 9 (The Genuine Pig TGP-CD-132) includes track 5 mono ■HOT ROCKS 1964-1971 (abkco 96672) includes track 7 stereo ■SINGLES COLLECTION / THE LONDON YEARS (abkco 92312) includes tracks 8,14 mono ■Necrophilia (VGP-317) includes track 9 stereo ■MORE HOT ROCKS (abkco 96262) includes track 10 stereo ■Bright Lights Big City (VGP-307) includes track 12 stereo Note; RCA Studios, Los Angeles, California, 1.17-18, 2.17.1965 (track 1), 1.17-18.1965 (track 2),5.11-12.1965 (tracks 4-10), 9.5.1965 (tracks 11-12), 9.6.1965 (track 13), Chess Studios, Chicago, Illinois, 5.10.1965 (track 3), IBC Studios, London, 10.26.1965 (track 14) CDR 008 - AFTERMATH SESSIONS 1966 (57 48) 1 19th Nervous Breakdown (outtake) 2 19th Nervous Breakdown (stereo version) 3 Sad Day (US 7"single) 4 Mother Little Helper (backing track) 5 Paint It, Black (edited backing track) 6 Paint It, Black (stereo version-different mix) 7 Paint It, Black (full length version) 8 Long Long While (7"single) 9 Lady Jane (backing track) 10 Out Of Time (backing track) 11 If You Let Me (outtake) 12 Con Le Mie Lacrime (without harpsichord version) 13 Con Le Mie Lacrime (Italia 7"single) 14 Out Of Time (outtake) 15 Have You Seen Your Mother, Baby, Standing In The Shadow ? (backing track) 16 Have You Seen Your Mother, Baby, Standing In The Shadow ? (outtake) 17 Have You Seen Your Mother, Baby, Standing In The Shadow ? (stereo version) 18 Who s Driving Your Plane (7"single) ■Time Trip Vol. 5 (Scorpio TT5) includes tracks 1-2, 6 stereo, tracks 5, 9,12,15,17 mono ■SINGLES COLLECTION / THE LONDON YEARS (abkco 92312) includes tracks 3, 7-8,18 mono ■Time Trip disc 3 (DAC-063) includes track 4 mono ■Masons Yard To Primrose Hill (VGP-112) includes track 10 mono ■METAMORPHOSIS (abkko 90062) includes tracks 11,14 stereo ■The Black Box Bonus CD (Yellow Dog YD 2000) includes track 13 mono ■The Black Box CD-1 (Yellow Dog YD 046) includes track 16 mono Note; RCA Studios, Los Angeles, California, 12.3-8.1965 (tracks 1-4), 3.6-9.1966 (tracks 5-11), 8.3-11.1966 (track 18), IBC Studios, London, 3.15.1966 (tracks 12-13), 8,31-9.2.1966 (tracks 15-17), Pye Studios, London, 4.27-30.1966 (track 14) CDR 009 - BETWEEN THE BUTTONS SESSIONS 1966 (52 42) 1 Yesterday s Papers (outtake) 2 Yesterday s Papers (baking track) 3 My Obsession (baking track) 4 All Sold Out (baking track) 5 Please Go Home (baking track) 6 Complicated (baking track) 7 Let s Spend The Night Together (baking track) 8 Get Yourself Together (Can t Believe / I Can See It) (outtake take 1) 9 Let s Spend The Night Together (baking track with chorus) 10 Ruby Tuesday (baking track) 11 Let s Spend The Night Together (stereo version) 12 Ruby Tuesday (stereo version) 13 Dandelion (outtake) 14 Get Yourself Together (Can t Believe / I Can See It) (ourtake 2-backing track) 15 Get Yourself Together (Can t Believe / I Can See It) (outtake 2) 16 Trouble In Mind (outtake) ■Time Trip disc 4 (DAC-063) includes tracks 1,13 mono, track 8 stereo ■The Black Box CD-2 (Yellow Dog YD 047) includes tracks 2-6,14 stereo, tracks 7,10 mono ■The Black Box CD-1 (Yellow Dog YD 046) includes track 9 mono ■THROUGH THE PAST, DARKLY (abkco 90032) includes tracks 11-12 stereo ■Accidents Will Happen (VGP-370) includes track 15 mono ■Hot Stuff Volume Two (Great Dane Records GDR 9417/ABCD) includes track 16 mono Note; RCA Studios, Los Angeles, California, 8.3-11.1966 (tracks 1-8), Olympic Sound Studios, London, 11.8-26.1966 (tracks 9-16) CDR 010 - THEIR SATANIC MAJESTIES REQUEST SESSIONS 1967 DISC 1 (19 33) 1 We Love You (7"single) 2 Dandelion (7"single) 3 We Love You (stereo version) 4 Dandelion (stereo version) 5 We Love You (rehearsal) ■SINGLES COLLECTION / THE LONDON YEARS (abkco 92312) includes tracks 1-2 mono ■MORE HOT ROCKS (abkco 96262) includes track 3 stereo ■THROUGH THE PAST, DARKLY (abkco 90032) includes track 4 stereo ■Time Trip disc 4 (DAC-063) includes track 5 stereo Note; Olympic Sound Studios, London, 6.12-13 21.1967 (tracks 2, 4-5), 7.2-22.1967 (tracks 1, 3) CDR 011 - THEIR SATANIC MAJESTIES REQUEST SESSIONS 1967 DISC 2 (57 49) 1 2000 Light Years From Home (rehearsal) 2 2000 Light Years From Home (take 1) 3 2000 Light Years From Home (takes 2-4) 4 2000 Light Years From Home (takes 5-6) 5 2000 Light Years From Home (takes 7-10) 6 2000 Light Years From Home (take 11) 7 2000 Light Years From Home (takes 12-13) 8 2000 Light Years From Home (takes 14-15) 9 2000 Light Years From Home (retakes 3-4) 10 5 Part Jam Part 1 (takes 1-2) 11 5 Part Jam Part 1 (takes 3-5) 12 5 Part Jam Part 5 (takes 1-3) 13 5 Part Jam Part 4 (takes 1-10) 14 5 Part Jam Part 4 (takes 11-15) 15 5 Part Jam Part 3 (takes 1-5) 16 5 Part Jam Part 2 (takes 1-5) ■Satanic Sessions Volume One disc 1 (Midnight Beat MB CD 120) includes tracks 1-16 stereo Note; Olympic Sound Studios, London, May-October 1967 (tracks 1-16) CDR 012 - THEIR SATANIC MAJESTIES REQUEST SESSIONS 1967 DISC 3 (60 32) 1 We Love You (takes 15-16) 2 We Love You (takes 17-19) 3 She s A Rainbow (takes 1-2) 4 She s A Rainbow (takes 3-7) 5 Citadel (takes 20-24) 6 Citadel (takes 25-31) 7 Citadel (takes 32-33) 8 Citadel (take 34) 9 Citadel (take with piano overdub) 10 In Another Land (takes 1-3) 11 In Another Land (takes 4-8) 12 In Another Land (take 9) 13 Child Of The Moon (take 10) ■Satanic Sessions Volume One disc 2 (Midnight Beat MB CD 121) includes tracks 1-13 stereo Note; Olympic Sound Studios, London, May-October 1967 (tracks 1-13) CDR 013 - THEIR SATANIC MAJESTIES REQUEST SESSIONS 1967 DISC 4 (60 23) 1 Child Of The Moon (takes 11-12) 2 Sing This All Together (take 7) 3 Sing This All Together (intro) 4 The Lantern (take 1) 5 The Lantern (takes 2-3) 6 The Lantern (takes 4-5) 7 The Lantern (take 10) 8 The Lantern (take 11) 9 The Lantern (take 14) 10 The Lantern (take 15-17) 11 The Lantern (retakes 1-3) 12 On With The Show (takes 1-3) 13 On With The Show (takes 4-6) 14 On With The Show (takes 7-10) ■Satanic Sessions Volume One disc 3 (Midnight Beat MB CD 122) includes tracks 1-14 stereo Note; Olympic Sound Studios, London, May-October 1967 (tracks 1-14) CDR 014 - THEIR SATANIC MAJESTIES REQUEST SESSIONS 1967 DISC 5 (58 09) 1 On With The Show (take 11) 2 On With The Show (takes 12+14) 3 In Another Land (chorus part, takes 1-2) 4 In Another Land (chorus part, takes 3-4) 5 In Another Land (chorus part, takes 5-14) 6 Majesties Honky Tonk (takes 1-2) 7 Majesties Honky Tonk (take 3) 8 Majesties Honky Tonk (takes 4-9) 9 Majesties Honky Tonk (takes 10) 10 Majesties Honky Tonk (takes 11-12) 11 Majesties Honky Tonk (takes 15-17) 12 Jam One (takes 1-7) 13 Jam One (takes 8-9) 14 Jam One (takes 10-15) 15 Title 15 (takes 1-3) 16 Title 15 (take 4) 17 Title 15 (takes 5) ■Satanic Sessions Volume One disc 4 (Midnight Beat MB CD 123) includes tracks 1-17 stereo Note; Olympic Sound Studios, London, May-October 1967 (tracks 1-17) CDR 015 - THEIR SATANIC MAJESTIES REQUEST SESSIONS 1967 DISC 6 (49 16) 1 Title 15 (takes 6) 2 Title 15 (takes 7) 3 Gomper (take 1) 4 Gomper (take 2) 5 Gomper (take 3) 6 Gomper (take 4) 7 Gomper (take 5) 8 Gomper (part 1, take 1) 9 Gomper (part 1, take 2) 10 Soul Blues (take 1) 11 Soul Blues (take 2) 12 Soul Blues (take 3) 13 2000 Man (takes 1-2) 14 2000 Man (take 3) 15 2000 Man (takes 4-5) ■Satanic Sessions Volume Two disc 1 (Midnight Beat MB CD 124) includes tracks 1-15 stereo Note; Olympic Sound Studios, London, May-October 1967 (tracks 1-15) CDR 016 - THEIR SATANIC MAJESTIES REQUEST SESSIONS 1967 DISC 7 (47 45) 1 2000 Man (take 6) 2 2000 Man (takes 7-8) 3 2000 Man (takes 9-11) 4 2000 Man (takes 13-15) 5 2000 Man (end part, takes 1-3) 6 2000 Man (intro, takes 1-2) 7 2000 Man (intro, takes 3-14) 8 Guitar/Organ Jam (similar to She Smiled Sweetly) 9 Blues 3 (takes 27-31) 10 Blues 3 (takes 32-39) 11 Blues 3 (takes 40-44) 12 Blues 3 (retakes 1-2) 13 Blues 3 (retake 3) 14 Blues 3 (retakes 4-5) ■Satanic Sessions Volume Two disc 2 (Midnight Beat MB CD 125) includes tracks 1-14 stereo Note; Olympic Sound Studios, London, May-October 1967 (tracks 1-14) CDR 017 - THEIR SATANIC MAJESTIES REQUEST SESSIONS 1967 DISC 8 (47 24) 1 Gold Painted Fingernails (take 1) 2 Gold Painted Fingernails (take 2) 3 Gold Painted Fingernails (takes 3-4) 4 Gold Painted Fingernails (takes 5-9) 5 Gold Painted Fingernails (takes 10-11) 6 Gold Painted Fingernails (take 12) 7 Gold Painted Fingernails (takes 13-16) 8 Gold Painted Fingernails (take 17) 9 Gold Painted Fingernails (takes 18-22) 10 Gold Painted Fingernails (take 23) 11 2000 Man (middle part, takes 2-3) 12 2000 Man (middle part, takes 4-6) 13 2000 Man (middle part, takes 7-10) 14 2000 Man (middle part, takes 11-12) 15 2000 Man (middle part, take 13) ■Satanic Sessions Volume Two disc 3 (Midnight Beat MB CD 126) includes tracks 1-15 stereo Note; Olympic Sound Studios, London, May-October 1967 (tracks 1-15) CDR 018 - BEGGARS BANQUET SESSIONS 1968 DISC 1 (43 35) 1 Rock Me Baby (rehearsal) 2 Stray Cat Blues (rehearsal) 3 Untitled (rehearsal) 4 Hold On, I m Comin (rehearsal) 5 Jumpin Jack Flash (rehearsal) 6 Untitled (rehearsal) 7 Some Satisfaction (rehearsal) 8 Rock Me Baby (rehearsal) 9 I ll Coming Home (rehearsal) 10 Untitled (rehearsal) 11 Conversations ■Surrey Rehearsals 1968 (VGP-108) includes tracks 1-11 mono Note; R.G. Jones Studios, Morden, Surrey, 2.21.1968 (tracks 1-11) CDR 019 - BEGGARS BANQUET SESSIONS 1968 DISC 2 (53 41) 1 Jig-Saw Puzzle (take 1) 2 Jig-Saw Puzzle (take 2) 3 Jig-Saw Puzzle (takes 3-5) 4 Jig-Saw Puzzle (take 6) 5 Jig-Saw Puzzle (takes 7-8) 6 Jig-Saw Puzzle (take 9) 7 Jig-Saw Puzzle (take 10) 8 Jig-Saw Puzzle (take 11) 9 Jig-Saw Puzzle (take 12) 10 Jig-Saw Puzzle (take 13) 11 Jig-Saw Puzzle (take 14) ■Satanic Sessions Volume Two disc 4 (Midnight Beat MB CD 127) includes tracks 1-11 stereo Note; Olympic Sound Studios, London, 3.17-4.3.1968 (tracks 1-11) CDR 020 - BEGGARS BANQUET SESSIONS 1968 DISC 3 (70 36) 1 Jumpin Jack Flash (backing track) 2 Child Of The Moon (backing track) 3 Jumpin Jack Flash (stereo version) 4 Child Of The Moon (stereo version) 5 Parachute Woman (early mix) 6 Stray Cat Blues (outtake) 7 Did Everybody Pay This Dues ? (outtake) 8 Street Fighting Man (US 7"single-mono different vocals version) 9 No Expectations (outtake) 10 Dear Doctor (outtake) 11 Dear Doctor (early mix) 12 Prodigal Son (stereo version) 13 Factory Girl (outtake) 14 Sister Morphine (outtake) 15 Hamburger To Go (Stuck Out All Alone) (outtake) 16 Blood Red Wine (outtake) 17 Family (outtake-electric version) 18 Still A Fool (outtake) ■Time Trip disc 4 (DAC-063) includes tracks 1-2 mono, tracks 9-10,14 stereo ■THROUGH THE PAST, DARKLY (abkco 90032) includes track 3 stereo ■SINGLES COLLECTION / THE LONDON YEARS (abkco 1218-2) includes track 4 stereo ■R.S.V.P. (Cool Blokes Production) includes tracks 5-6,11-13 stereo ■Necrophilia (VGP-317) includes track 7 stereo ■SINGLES COLLECTION / THE LONDON YEARS (abkco 92312) includes track 8 mono ■The Trident Mixes (DAC-052) includes tracks 15-18 stereo Note; Olympic Sound Studios, London, 3.17-4.3.1968 (tracks 2, 4-7), 4.20.1968 (tracks 1, 3), 5.13-23.1968 (tracks 8-18) Note; track 11 (R.S.V.P. track 17) CDR 021 - BEGGARS BANQUET SESSIONS 1968 DISC 4 (62 22) 1 Sympathy For The Devil (early takes part 1 from one plus one ) 2 Sympathy For The Devil (early takes part 2 from one plus one ) 3 Sympathy For The Devil (early takes part 3 from one plus one ) 4 Sympathy For The Devil (early takes part 4 from one plus one ) 5 Sympathy For The Devil (early takes part 5 from one plus one ) 6 Sympathy For The Devil (early takes part 6 from one plus one ) 7 Sympathy For The Devil (early takes part 7 from one plus one ) 8 Sympathy For The Devil (early takes part 8 from one plus one ) 9 Sympathy For The Devil (early takes part 9 from one plus one ) 10 Sympathy For The Devil (early takes part 10 from one plus one ) 11 Sympathy For The Devil (edited 3rd strophe) 12 Sympathy For The Devil (beggars banquet) 13 Jam (London Jam) (part 1 from one plus one ) 14 Jam (London Jam) (part 2 from one plus one ) 15 Family (acoustic version) 16 Family (with additional bass guitar percussions) ■Political Cartoons (JJ Records) includes tracks 1-10,13-14 mono ■R.S.V.P. (Cool Blokes Production) includes track 11 stereo ■BEGGARS BANQUET (London 800 084-2) includes track 12 stereo ■The Trident Mixes (DAC-052) includes track 15 stereo ■METAMORPHOSIS (abkko 90062) includes track 16 stereo Note; Olympic Sound Studios, London, 6.4-10.1968 (tracks 1-14), 6.28.1968 (tracks 15-16) CDR 022 - LET IT BLEED SESSIONS 1969 DISC 1 (42 17) 1 Honky Tonk Women (outtake) 2 You Can t Always Get What You Want (edited stereo version) 3 Gimme Shelter (outtake) 4 Gimme Shelter (different vocals version 1) 5 Gimme Shelter (different vocals version 2) 6 You Got The Silver (Mick Jagger on lead vocals version) 7 Sister Morphine (different mix) 8 I Was Just A Country Boy (outtake) 9 Downtown Suzie (Lily Street Lucie) (basic track) 10 Downtown Suzie (Lily Street Lucie) (remixed version) ■The Black Box CD-3 (Yellow Dog YD 048) includes tracks 1, 3 stereo ■SINGLES COLLECTION / THE LONDON YEARS (abkco 1218-2) includes track 2 stereo ■Time Trip disc 1 (DAC-063) includes tracks 4, 6 stereo ■Time Trip disc 4 (DAC-063) includes track 5 stereo ■Sotheby s Reel 1969-1970 (Idol Mind Production IMP-N-013) includes track 7 stereo ■The Trident Mixes (DAC-052) includes tracks 8-9 stereo ■METAMORPHOSIS (abkko 90062) includes track 10 stereo Note; Olympic Sound Studios, London, 2.10-3.31.1969 (tracks 1-8), 4.23.1969 (tracks 9-10) CDR 023 - LET IT BLEED SESSIONS 1969 DISC 2 (46 54) 1 Honky Tonk Women (basic track) 2 Honky Tonk Women (stereo version) 3 Country Honk (basic track) 4 Loving Cup (outtake) 5 Jiving Sister Fanny (take 1) 6 Jiving Sister Fanny (take 2) 7 I Don t Know Why (basic track) 8 I Don t Know Why (remixed version) 9 All Down The Line (outtake-acoustic version) 10 I m Going Down (basic track) 11 Hillside Blues (I Don t Know The Reason Why) (outtake) ■Olympic Years 1967-69 (Dandelion 94003) includes track 1 mono ■SINGLES COLLECTION / THE LONDON YEARS (abkco 92312) includes track 2 stereo ■The Black Box CD-3 (Yellow Dog YD 048) includes track 3 mono, track 9 stereo ■Sotheby s Reel 1969-1970 (Idol Mind Production IMP-N-013) includes track 4 stereo ■The Trident Mixes (DAC-052) includes tracks 5, 7, 10 stereo ■METAMORPHOSIS (abkko 90062) includes tracks 6, 8 stereo ■Hillside Blues (VGP-214) includes track 11 stereo Note; Olympic Sound Studios, London, 4.17-7.2.1969 (tracks 1-8), Sunset Sound Studios Elektra Studios, Los Angeles, California, 10.17-11.2.1969 (tracks 9-11) NEXT
https://w.atwiki.jp/suffix/pages/257.html
GoogleGeoCodingAPI(ジオコーディング：住所から地図の場所の表示)http //dambiyori.sakura.ne.jp/garakuta/gmageo.html(ソースコードはご自由にって書いてあるし楽できそう) http //googlemapsapi.blogspot.com/2006/12/japanese-address-and-placename-support.html http //www.geocoding.jp/api/(このサイトのJSON形式についてhttp //teddy-g.cocolog-nifty.com/blog/2005/10/google_mapsgoog_7cbb.html) GLocalSearch()を使うhttp //nyanjiro.no-blog.jp/web20/2006/06/googleapigoogle_0eee.html http //www7a.biglobe.ne.jp/~datacollect/google_ajax_search_api.html http //nyanjiro.net/pathway/pathway_map2.html http //www.nobodyplace.com/mutter/2007/11/01/153152.php http //code.google.com/apis/ajaxsearch/documentation/reference.html GClientGeocoder()を使うhttp //zorgmon.googlepages.com/geocoder-jp.html やばい、ウィザードとかあった。たぶん、これが一番簡単！っぽいと思ったが確か日本対応してなさそうだ・・・http //code.google.com/intl/ja_ALL/apis/ajaxsearch/wizards.html
https://w.atwiki.jp/kenyaer/pages/14.html
It s approaching that time of yr a href="http //www.wesellwatch.com" breitling replica /a once the environment is getting warmer, the nights are getting lengthier and you re contemplating getting your summer time garments out. Only problems is, if you unpack your summer time attire from their winter hideaways, you uncover that several of it is looking tired and away from date. while some traditional pieces which consist of a href="http //www.wesellwatch.com/products/big_Cartier_1.html" cartier replica watches /a loose fitting tattersall shirts and deck shoes are usually in fashion, all those Hawaiian shirts may really only be left for holidays or fancy attire occasions. Cardigans are create getting a staple for grownup men this summer, great for all those cooler evenings. while this kind of attire may possibly conjure up pictures of the pipe and a href="http //www.poloestore.com/-Discount-ralph-lauren-men-mens-hoodies_c726.html" cheap hoodies /a slippers, cardigans are now appearing in rock star wardrobes. Stick to greys, blacks and creams, which could be teamed with brighter shirts or tops. Casual rugby tops and polo shirts are back again this summer time with vengeance - or stripes. Horizontally striped shirts a href="http //www.hotsalepolos.com/mens-ralph-lauren-hoodies-c-2.html" Ralph Lauren hoodies /a are previously inside the stores - choose broad prevent stripes for the most flattering appear and turn that training collar up for just about any polo player-esque style. instead of the tighter fitting Lacoste polos belonging for the previous due eighties and earlier nineties, this season s shirts are developed getting put on loose and layered with tees. Team rugby shirts with challenging placing on gilets for the ultimate outside look, beiges, greens and stones a href="http //www.poloestore.com/" polo ralph lauren online shop /a are probably the most well-known colours which enable it to run with most colours. think a increased street edition of Bear Grylls for this season, useful however stylish and masculine. Many individuals currently are inclined to a href="http //www.lookpolo.com/mens-ralph-lauren-jackets-c-1.html" Ralph Lauren jackets /a acquire their individual style primarily to process an photo of the uniqueness and character even although achieving comfort for their satisfaction. merely as a end result with this interpersonal interest, drastically more and drastically more style collection and styles are appearing inside the present marketplace opening up new assortment choices for the desire. a href="http //www.poloestore.com/-Discount-ralph-lauren-women-womens-hoodies_c740.html" Hoodies for sale /a Regardless, there is one particular outfit that is nonetheless wanted by an awesome offer of amidst the many choices out there. The lacoste polo has usually been an enormous assortment for outfit for the population. drastically more grownup men favor placing on Lacoste shirt merely as a end result of its increased worth for quality, aesthetic, and comfort providing you probably a href="http //www.hotsalepolos.com/mens-ralph-lauren-striped-polo-c-10.html" short sleeve shirts /a the most effective there is for the investment. However, credited for the fast-paced present life-style belonging for the society, an awesome offer of are acquiring considerable challenge to acquire their wanted Lacoste polo for their wardrobe like deficiency of your time to hold out purchasing and even as well tired to browse the assortment at a reseller store. For this reason, there is really a viable assortment around for the concern, effective and reputable adequate to help your style interest. Finding help greater compared to Internet The internet currently appears getting a a href="http //www.poloestore.com/-Discount-lacoste-men-lacoste-short-sleeve-polos_c747.html" Lacoste shirts /a amazing help for different kinds of concern. using the support with this present discussion technology, individuals can interact with every one other greater than huge distances, research information with ease, as well as locate options to their just about every problem. inside the style concern of acquiring your wanted Lacoste polo, the internet may be also there to help you. To cater to higher populace looking for to possess their wanted Lacoste polo, different team companies have developed reseller support companies greater compared to internet buying and selling broad assortment of products and companies for just about every desiring buyer. These companies are previously relatively like a high-tech store aiming to provide you with effective support and comfort for the concern through their technological aid. Yes, without possessing even standing and travelling for the purchasing centre, you can now locate and purchase your Lacoste polo greater compared to internet.
https://w.atwiki.jp/kaiben100/pages/77.html
ころっけ社長語録 １ ころっけ社長語録 ２ ころっけ社長語録 情報戦編 １ ころっけ社長語録 情報戦編 ２ ころっけ社長語録 情報戦編 ３ ころっけ社長語録 情報戦編 ４ ころっけ社長語録 情報戦編 ５ ころっけ社長語録 情報戦編 ６ ころっけ社長語録 情報戦編 ７ ころっけ社長語録 情報戦編 ８ ころっけ専用冷蔵庫（サブ板の社長のスレ） ころっけ専用冷蔵庫の保管庫 イスラム教原理主義者の解釈と（直訳）コーランの差 これからの東亜情勢と在日に残された作戦？論 Part ころっけ社長ＩＤ ８６ ・yvmhBrXZg ８７ ・yvmhBrXZg ・4xe4D0q4T ８８ ・4xe4D0q4T ８９ ・4xe4D0q4T ・2dbEilu9m ９０ ・2dbEilu9m ９１ ・2dbEilu9m ９２ ・uOV5X0YmK ９３ ・3O3bz6RgA ９４ ・3O3bz6RgA ・3O3bz6RgA ９５ ・3O3bz6RgA ９６ ・3O3bz6RgA ・RuGPSIECh ９７ ・RuGPSIECh ９８ ・RuGPSIECh ・08qGxoVCV ９９ ・08qGxoVCV 100 ・08qGxoVCV ・bZbOdJDfp 101 ・bZbOdJDfp 102 ・bZbOdJDfp ・Vxgd3noHx 103 ・Vxgd3noHx 104 ・Vxgd3noHx ・cl99LHm9L 105 ・cl99LHm9L 106 ・t0SSiVqaV 107 ・t0SSiVqaV 108 ・t0SSiVqaV ・KG7gywsgL 109 ・KG7gywsgL 110 ・U7XRr4S7F 111 ・U7XRr4S7F ・OU7VeLYur 112 ・OU7VeLYur 113 ・ukZth5G6c 114 ・ukZth5G6c 115 ・ukZth5G6c ・WYO0AYEbf 116 ・WYO0AYEbf 117 ・WYO0AYEbf 118 ・fxlgbQRtp 119 ・fxlgbQRtp 120 ・fxlgbQRtp ・1fReqpOny 121 ・1fReqpOny 122 ・1fReqpOny ←スレ消化最速記録、２時間３６分０４秒 123 ・2M5UIE4TZ 124 ・2M5UIE4TZ 125 ・2M5UIE4TZ 126 ・2M5UIE4TZ ・ZnZb2QxRt 127 ・ZnZb2QxRt 128 ・ZnZb2QxRt ・v9FsBQfsm 129 ・v9FsBQfsm ・UbnK1Cgno 130 ・UbnK1Cgno 131 ・UbnK1Cgno 132 ・CVtWff4AV 133 ・CVtWff4AV ・y4j7HoBKX 134 ・y4j7HoBKX ・V2BUEtwHI 135 ・V2BUEtwHI 136 ・DV1qCXQ3s 137 ・DV1qCXQ3s 138 ・CHTRCIYi2 139 ・CHTRCIYi2 ・hYW42eAeJ 140 ・hYW42eAeJ ・aT7EPYtjH 141 ・aT7EPYtjH 142 ・UikmI3CcV ・BZeeKKkEp 143 ・BZeeKKkEp 144 ・BZeeKKkEp 145 ・BZeeKKkEp ・K9zItCQo4 146 ・K9zItCQo4 147 ・INkGgdlcv 148 ・abLioZ8pd 149 ・abLioZ8pd 150 ・BvQtiNCxS 151 ・BvQtiNCxS 152 ・BvQtiNCxS 153 ・yifRsViGL ・g6WJLmiRq 154 ・g6WJLmiRq 155 ・g6WJLmiRq 156 ・g6WJLmiRq 157 ・ejSyE3TgU 158 ・なし 159 ・ejSyE3TgU 160 ・RL7wgWfYO 161 ・なし 162 ・2CRSUhAMm 163 ・2CRSUhAMm 164 ･FwKHOHbLO 165 ・なし 166 ・なし 167 ・8893J0nrG 169 ･なし 170 ･なし 171 ・pLd11wg4F 172 ・wmkt2SIoh 245 ・gp6F4cpml 246 ・gp6F4cpml ・mQVoxEbNi 247 ・mQVoxEbNi ・9WqJuqQVx 248 ・9WqJuqQVx ・t2N9KYAgv 250 ・XPRL2yHol ・ZpbnaAMl3 251 ・ZpbnaAMl3 ・CAh2h09wK 252 ・bzJgkYLZm 253 ・kZWxsKji3 254 ・y3fVaZTBJ 255 ・VijnIEwcs ・GMb2dOLIZ ・KyCLz4obP 256 ・KyCLz4obP ・HoVxAN3jx ・sanXX5xDF 257 ・HoVxAN3jx ・YFyEteaeN 258 ・YFyEteaeN ・nZXAXHWSE ・nZXAXHWSE ・YFyEteaeN ・7GfQHgONf259 ・nZXAXHWSE 260 ・34Q9Jvcp3 ・nXAKpblZL 261 ・nXAKpblZL ・QOZ1TF0ME ・9L5DhAMuq 262 ・vQ4lh97Je 263 ・なし 264 ・なし 265 ・なし 266 ・1AFJhD7yS ・8r19HHRnO 267 ・ffDgtjJtR 268 ・ffDgtjJtR ・FerxNC0bV 269 ・FerxNC0bV ・ExQPMmvls 270 ・ExQPMmvls 271 ・M9v7EbTnf 272 ・QioSLJMJ6 ・LTkXxH8PQ 273 ・LTkXxH8PQ ・4b4Dgj5AK 274 ・4b4Dgj5AK 275 ・4b4Dgj5AK ・n26gYIGO9 276 ・n26gYIGO9 ・sdN7EP9lQ 277 ・sdN7EP9lQ ・WczdGchBU 278 ・WczdGchBU ・58PyXmyxf 279 ・58PyXmyxf ・BBrhoEKqX ・BBr 280 ・BBr ・aEA 281 ・aEA ・BS0 ・wHi ・b2Q 282 ・BS0 283 ・BS0 ・wg6
https://w.atwiki.jp/v-lyrics/pages/152.html
ゆにばーすとりにてぃー [ TAG Alp-U E-Q Miku NV_sm3786093 Nene@Aoitorinouta Title] Music Nene@Aoitorinouta/音々＠あおいとりのうた Lyric Nene@Aoitorinouta/音々＠あおいとりのうた Arrange Nene@Aoitorinouta/音々＠あおいとりのうた Vocal Hatsune Miku Videos PVs ■ Show/Hide Video http //www.nicovideo.jp/watch/sm3786093 http //www.nicovideo.jp/watch/sm3786093 Translations ■ Show/Hide Romaji 2009-03-25 20 34 First Entry Translation Draft by RomajiGateway 09-03-29 Updated Checked by BookPeople kaze , utau hoshi , hikaru kumo , asobu sora wo oyogu hane hiroge sah ... hishou ! te wo nobashi umare yuku oto , tsukamu hiroi sekai kobore ochiru oto no kakera itsuka meguri yuku haruka kanata umo reteyuku na mo naki hoshi tachi kami yo kami yo utai tsuduke mashou iki ru oto de ari tsuduke ru kagiri daichi ni me buku hana wo mede mori , kake meguru kodama , hibiku kobore ochiru inochi no tane daichi ni hagukumu haruka kanata uta wo utau na mo naki kakera tachi sekai no hate mada minu uta umare te yuku oto no kakera me buku inochi idaki nagara sekai wo ima mo tera su hikari otte yukuyo watashi ga (uta wo) oto de (utau) ari tsuduke ru kagiri [部分編集] ■ Show/Hide EnglishTranslation Universe Trinity 09/03/02 First Entry 2009-03-02 14 47 55 (Mon) Last update Trasnlated by BookPeople Title Universe Trinity Lyric 風、歌う Wind sings 星、光る Stars twinkle 雲、遊ぶ Cloud plays 空を泳ぐ swimming in the sky 羽 Unfold wings 広げ さあ…飛翔！ Now, fly! 手を伸ばし Stretching my hands 生まれゆく And holding on sound which is born 音、掴む 広いセカイ Vast universe 零れ落ちる 音のカケラ Fragments of the sound to overflow いつか巡り行く Reaching it someday 遥か彼方 In a far off distance 埋もれてゆく Nobody minds 名も無き 星たち Stars which don t have the name 神よ 神よ 歌い続けましょう Gaia, Gaia, I will continue singing 生きる As far as there continues being me as a sound to live 音で 在り続ける限り 大地に芽吹く Budding in the earth 花を愛で Flowers are enjoyed 森、駆け巡る Running about in the forest 木霊、響く Echo sounds 零れ落ちる 生命の種 Seeds of the life to overflow 大地に育む Growing up on the earth 遥か彼方 In a far off distance 歌を 歌う Singing a song 名も無き 欠片たち Fragments which don t have the name 世界の果て まだ見ぬ歌 In the ends of the world The songs I don t yet listen to 生まれてゆく 音のカケラ Fragments of the sound to be born 芽吹く命 抱きながら Holding the budding life 世界を 今も照らす Chasing light that shines on the world now 光 追ってゆくよ 私が （歌を） As far as there continues being me as a sound 音で （歌う） (As far as there continues to sing a song) 在り続ける限り Wind sings Stars twinkle Cloud plays Swimming in the sky Unfold wings Now, fly! Stretching my hands And holding on sound which is born Vast universe Fragments of the sound to overflow Reaching it someday In a far off distance Nobody minds Stars which don t have the name Gaia, Gaia, I will continue singing As far as there continues being me as a sound to live Budding in the earth Flowers are enjoyed Running about in the forest Echo sounds Seeds of the life to overflow Growing up on the earth In a far off distance Singing a song Fragments which don t have the name In the ends of the world The songs I don t yet listen to Fragments of the sound to be born Holding the budding life Chasing light that shines on the world now As far as there continues being me as a sound (As far as there continues to sing a song) Comment If you have any advise or opinion for this post please write here.この投稿に対して助言、ご意見などありましたらこちらに書き込んで下さい。 Name Comment すべてのコメントを見る Last modified 2009-03-02 14 47 55 (Mon) Original Lyric, Nicosound MP3, etc http //www5.atwiki.jp/hmiku/pages/4329.html http //nicosound.anyap.info/sound/sm3786093 http //www.nicomimi.com/play/sm3786093 Sub video, PV, other fan made video in YouTube http //www.youtube.com/watch?v=hD1j9L2FcOI [Add] http //www.youtube.com/watch/xxxxxxxxx ADD LINK すべてのコメントを見る http //www.youtube.com/watch?v=hD1j9L2FcOI (Information in this page is based on HatsuneMiku@Wiki) _
https://w.atwiki.jp/api_programming/pages/234.html
Automate/Documentation/Values - LlamaLab Values Automate support the following value types Null Number Text Array Dictionary Null Null is a special keyword denoting a undefined/missing value. Number Numbers are stored internally as double-precision 64-bit IEEE 754 floating point values. See Arithmetic operators. Number literal Numbers can be represented in expressions with following literals decimal number (base-10) with or without a fractional part and exponent; 123.45 hexadecimal (base-16) using the 0x prefix; 0xCAFEBABE binary number (base-2) 頭に0bを付ける例：0b00110011 Text Text, or string, is a sequence of characters. Text literal テキストはダブルクォーテーションで囲む "Hello world". In addition to ordinary characters, you can also include special characters within text literals Character Description {expression} String interpolation, see below. \b Backspace \f Form feed \n 改行 \r Carriage return \t Tab \ Single quote/Apostrophe \" Double quote \\ バックスラッシュ \{ Avoid interpretation of left curly-bracket as start of a string interpolation \uXXXX The Unicode character specified by the four hexadecimal digits XXXX. For example, \u00A9 is the Unicode sequence for the copyright symbol. String interpolation String interpolation とは実行中に評価される値を含む文字列を生成する方法。 Each “interpolation” inside a text literal is wrapped in curly brackets; "1 times 3 is {1*3}". To format the inserted value add a function name after the expression; "1 times 3 is {1*3;numberFormat}". Any additional arguments are passed to the function as text; "Today is {now;dateFormat;MMM dd}. Array An array is a container object that holds a dynamic number of values of any type. Each item in an array is called an element, and are accessed by its numerical integer index. The index is zero-based, first element has index 0, last element has index length - 1. A negative index will access the array from the end (length + index). To access an array use the subscript operator, length operator and for each block. To modify an array use the array add block, array remove block and array set block. Array literal An array literal is a list of zero or more expressions, each of which represents an array element, enclosed in square brackets [ ] [ 1, "two", 3.0, null, dict ] Dictionary A dictionary is a container composed of エントリ(entry)と呼ばれる"key-value" のペアで構成される。 各キーは高々1回登場する。 キーはテキストのみ、null を含む文字以外の値は、テキストに変換される。 値はどのタイプでも良い Each entry can also have an associated conversion type, used when communicating with apps supporting other value types. To access a dictionary use the subscript operator, length operator and for each block. To modify a dictionary use the dictionary put block and dictionary remove block. Dictionary literal dictionary literal は、0以上のエントリを持つリストであり、 "{}" で囲まれて表現している。 { "a" 1, "b" as int 3.333, "c" as uri "http //llamalab.com" } Dictionary conversion types Automate では "number", "text", "array", "dictionary" の4つのタイプのみをサポートしている。 Android OS を含むその他のアプリでは、それ以外の値をサポートしている場合がある。そのため、他のアプリから送られてきたエントリの値は変換される必要がある。 ある値をどんな値に変換するかを特定するために "as" キーワードをキーの後に用いる。 "link" as uri "http //llamalab.com". The following conversion types are allowed Boolean BooleanArray Bundle BundleArray BundleList Byte ByteArray Char CharArray CharSequence CharSequenceArray CharSequenceList ComponentName ComponentNameArray ComponentNameList Double DoubleArray Float FloatArray Int IntArray IntList Intent IntentArray IntentList Long LongArray Short ShortArray String StringArray StringList Uri UriArray UriList
https://w.atwiki.jp/physnote/pages/24.html
アカデミックなメモ TeXTeXの学会スタイルファイル あまり品のよくないdouble space化 他人の文章にコメントなどを追加する用 tex改行位置調整 図表の位置制御 book.clsでoneside aspell list bibtexリスト自動生成関連 itemizeで改行したときに左はじをそろえる方法 gs, eps2eps, ps2pdf, pdftkの仕様やバグgsによる処理 psのBoundingBoxに合わせたpdf作成 pdfから正しいBoundingBoxのついたepsを作成 使えそうなネタ まとめ A0ポスター完全アウトライン化（フォント文字化け対策） 文字のみのアウトライン化 eps圧縮関連 手書きepsの図作成関連 pdf分割・結合 pdfのパスワード解除 gnuplotの図の入ったtex文書をdvipsで処理するとpdfinfoがバグる 図の作成関連gnuplotの図の修正 gnuplotでつくったsvgの図をInkscapeで編集 gnuplotでつくったepsをtexでpdfにするときのフォント埋め込み gnuplot等でフォントを埋め込んだepsの軽量化 gnuplotの色づかい gnuplotで中抜き（白塗り）のマーク gnuplotで掛け算記号 グラフからデータの抽出 gnuplot以外の選択肢 非常に参考になるサイト C language memofgets + sscanf malloc mpi lapack icc disable annoying remarks shell command memobash/csh：標準出力と標準エラー出力 shでファイル名を取得 bashで小数演算（bc使用） awkコマンドに引数を渡す方法 awkで文頭が#の行を削除 find+exec/find+xargs wget arXiv.orgのソースの展開 rsync web, css関連validator 画像の使用を極力控えてかっこいいCSSデザインをやってみよう大会 twitter関連ログ保存 タイムライン関連のAPI /user_timeline twitter ubuntu クライアントEchofon TwitterBar twitte.rb mitter TeX TeXの学会スタイルファイル debian系ならtexlive-publishersをapt-getすればよい。 http //packages.debian.org/ja/lenny/texlive-publishers http //packages.ubuntu.com/ja/hardy/all/texlive-publishers 一応、本家も。 REVTeX4： http //authors.aps.org/revtex4/ JPSJ： http //jpsj.ipap.jp/authors/style.html # http //www.lightstone.co.jp/products/swp/kb0056.htm あまり品のよくないdouble space化 \renewcommand{\baselinestretch}{1.5} 一応、他にもやり方はある。 以下、http //tug.ctan.org/get/info/l2tabu/english/l2tabuen.pdf から引用。 Changing inter-line space using \baselinestretch As a rule of thumb, parameters should be set on the highest possible level within a user interface. So if you want to reset inter-line space you can do so on three levels 1. Either by using the setspace.sty package; 2. or by using the LATEX command \linespread{ factor }; 3. or by redefining \baselinestretch. Redefining parameters such as \baselinestretch works on the lowest LATEX level available— which should better be left to packages. The \linespread command is provided for this, so it is a better way to get more inter-line space than fiddling with \baselinestretch. It is even better, though, to use setspace.sty which also takes care of space in footnotes and list environments that you usually don’t want to change when modifying inter-line space. So if you just need some more spacing between lines, say, you would like to set spacing to one half or to double spacing, setspace.sty provides the easiest way to achieve this. However, if you only want to use fonts other than Computer Modern you may use \linespread{ factor }. For example, when using Palatino \linespread{1.05} would be appropriate. 他人の文章にコメントなどを追加する用 多分、soutはstrikeoutの略。 \usepackage{color}% 適宜[dvipdfm]などを付けてください。 %\usepackage{ulem} \usepackage[normalem]{ulem} \newcommand{\tr}[1]{\textcolor{red}{#1}} \newcommand{\trs}[1]{\textcolor{red}{\sout{#1}}} \newcommand{\tb}[1]{\textcolor{blue}{#1}} \newcommand{\tbs}[1]{\textcolor{blue}{\sout{#1}}} %\newcommand{\tg}[1]{\textcolor{green}{#1}} \definecolor{darkgreen}{rgb}{0,0.5,0} \newcommand{\tg}[1]{\textcolor{darkgreen}{#1}} \newcommand{\tgs}[1]{\textcolor{darkgreen}{\sout{#1}}} \definecolor{purple}{rgb}{0.5,0,0.5} \newcommand{\tp}[1]{\textcolor{purple}{#1}} \newcommand{\tps}[1]{\textcolor{purple}{\sout{#1}}} # 参考文献の出力をitalicのままにしたければ # \usepackage[normalem]{ulem} にする。 # http //aki.issp.u-tokyo.ac.jp/itoh/hiChangeLog/html/2006-12.html#2006-12-10 tex改行位置調整 \sloppy \fussy http //www27.cs.kobe-u.ac.jp/~masa-n/misc/cmc/j-kiso2001/iabasic/jlshort/node13.html 図表の位置制御 \renewcommand{\topfraction}{1.1} \renewcommand{\bottomfraction}{1.1} \renewcommand{\dbltopfraction}{1.1} \renewcommand{\textfraction}{-0.1} \renewcommand{\floatpagefraction}{1.1} \renewcommand{\dblfloatpagefraction}{1.1} \setcounter{topnumber}{5} \setcounter{bottomnumber}{5} \setcounter{totalnumber}{10} http //www.imc.cce.i.kyoto-u.ac.jp/~umehara/misc/comp/latex.html http //denki.nara-edu.ac.jp/~yabu/soft/tex/tex.html book.clsでoneside \documentclass[a4paper,oneside,12pt]{book} など。 http //blog.as-is.net/2009/04/bookcls-oneside-cleardoublepage.html aspell list http //fts.ifac.cnr.it/cgi-bin/dwww?type=runman location=aspell/1 #!/bin/bash #cat ./tex_en/*.tex | aspell --lang=en --mode=tex list | sort mispelledwords_out filedate=`date +%Y%m%d_%k%M%S` filename=mispelledwords_out echo "# ${filedate}" ${filename} for i in ./tex_en/*.tex do echo "#----" ${filename} echo "# ${i}" ${filename} cat ${i} | aspell --lang=en --mode=tex list ${filename} done rm -f *~ bibtexリスト自動生成関連 getpaper http //www.cns.s.u-tokyo.ac.jp/~daid/hack/getpaper.html http //www.cns.s.u-tokyo.ac.jp/~daid/hack/getpaper example getpaper -j prl -v 99 -p 052502 or getpaper -f [input_file] doi2bibtex.py http //pebblesinthesand.wordpress.com/2011/06/24/script-for-downloading-bibtex-file-using-doi/ Turning DOIs into formatted citations http //crosscite.org/cn/ http //www.crossref.org/CrossTech/2011/11/turning_dois_into_formatted_ci.html http //tex.stackexchange.com/questions/6848/automatically-dereference-doi-to-bib http //stackoverflow.com/questions/9403661/how-can-i-specify-content-type-accepted-when-requesting-a-http-resource-with-rub example curl -LH "Accept text/bibliography; style=bibtex" http //dx.doi.org/10.1038/nrd842 or curl -LH "Accept application/x-bibtex" http //dx.doi.org/10.1038/nrd842 Towards minimal bibliographic managment software http //sieste.wordpress.com/2012/05/17/towards-minimal-bibliographic-managment-software/ Stephen s BibTeX tools http //www.cl.cam.ac.uk/~srk31/goodies/research/bibtex/ http //www.cl.cam.ac.uk/~srk31/goodies/research/bibtex/paper-keywords itemizeで改行したときに左はじをそろえる方法 http //tex.stackexchange.com/questions/56809/multiline-item-indent gs, eps2eps, ps2pdf, pdftkの仕様やバグ gsによる処理 ps2ps, eps2epsは稀にバグるときがある（気がする）。 こいつらはgsを使ってるらしい http //linux.die.net/man/1/ps2ps http //linux.die.net/man/1/eps2eps が、パラメータの指定が悪いせいだろう。 だったら、最初からgsで処理すればよい。 eps2epsのソースをハックする。 http //www.google.com/codesearch?hl=en q=eps2eps+lang%3Ashell で、その結果は以下のとおり。 BoundingBoxの取得（BoundingBoxを修正したいとき） gs -q -sDEVICE=bbox -dNOPAUSE -dSAFER -dBATCH -dDEVICEWIDTH=250000 -dDEVICEHEIGHT=250000 input.ps output.bb 2 1 PS本文の取得（重いPSを軽くしたいとき） gs -q -sDEVICE=epswrite -dNOPAUSE -dSAFER -dBATCH -dDEVICEWIDTH=250000 -dDEVICEHEIGHT=250000 -sOUTPUTFILE=output.ps input.ps サイズが小さいとBoundingBoxを間違えるようなので -dDEVICEWIDTH=250000 -dDEVICEHEIGHT=250000 とPSの幅を大きめに取ってる。これでも誤るようなら、 もっと大きい値を入れればよい。 psのBoundingBoxに合わせたpdf作成 psのBoundingBoxに合わせてpdfをつくりたいときは ps2pdf -dEPSCrop foo.ps とすればいいらしい。 だが、-dEPSCropでpsをpdfにするとき、できあがった pdfのBoundingBoxがA4になるときがある。 そんなときは、psの頭を %!PS-Adobe-3.0 EPSF-3.0 に書き換えたら、欲しいpdfがつくれるかもしれない。 詳しくは http //ghostscript.com/pipermail/gs-bugs/2008-February/000969.html http //bugs.ghostscript.com/show_bug.cgi?id=689726 を参照のこと。 pdfから正しいBoundingBoxのついたepsを作成 http //www.iml.ece.mcgill.ca/~stephan/oopdf2eps から引用。 #!/bin/bash TARGET=${1%.pdf}.eps echo "pdftops -eps ${1} - | ps2eps ${TARGET}" pdftops -eps ${1} - | ps2eps ${TARGET} echo "ps2eps stdout redirected to ${TARGET}" 使えそうなネタ http //hisashim.livejournal.com/362039.html http //hisashim.livejournal.com/381401.html まとめ 全部合わせると #!/bin/bash input=$1 output=$2 gs -q -sDEVICE=bbox -dNOPAUSE -dSAFER -dBATCH \ -dDEVICEWIDTH=250000 -dDEVICEHEIGHT=250000 \ ${input}.ps ${output}_tmp.bb 2 1 gs -q -sDEVICE=epswrite -dNOPAUSE -dSAFER -dBATCH \ -dDEVICEWIDTH=250000 -dDEVICEHEIGHT=250000 \ -sOUTPUTFILE=${output}_tmp.ps ${input}.ps head -1 ${output}_tmp.ps ${output}.ps cat ${output}_tmp.bb ${output}.ps tail -$(( `wc -l ${output}_tmp.ps` - 3 )) \ ${output}_tmp.ps ${output}.ps rm ${output}_tmp.* ps2pdf -dEPSCrop ${output}.ps でpsのソースを綺麗に整形して、pdfにできる。 A0ポスター完全アウトライン化（フォント文字化け対策） 一部のプリンターではA0印刷したときに、「フォントの埋込み」をした文字ですら文字化けすることがある。 それに対処する方法として、pdfのアウトライン化（全画像化）を紹介する。まず、pdfをepsに変換する。その後、gsを使ってepsをアウトライン化する。解像度は"-r"で指定する。最後に、epsをpdfに変換する。 pdftops -eps input.pdf gs -q -sDEVICE=epswrite -dNOPAUSE -dSAFER -dBATCH -dDEVICEWIDTH=2500000 -dDEVICEHEIGHT=2500000 -r9600 -sOUTPUTFILE=output.eps input.eps ps2pdf -dEPSCrop output.eps rm input.eps output.eps 難点は、ファイルサイズが重くなることとBoundingBoxがずれること。後者はeps作成後に手動で書き換えれば、対処できなくはないが…。 参考：http //www.meteorology.jp/XOOPS/modules/newbb/viewtopic.php?topic_id=32 forum=2 文字のみのアウトライン化 上のコマンドで、widthとresolutionを指定する代わりに、 -dNOCACHE を付け加えればよい。 eps圧縮関連 http //www.proton.jp/main/latex/tips.html#jpeg2eps http //www.iir.me.ynu.ac.jp/~maeda/comp/epstips.html http //www.daicas.net/compressed-images-in-PS-PDF/article.html http //www.heikopurnhagen.net/software/jpg2eps http //www.rmatsumoto.org/tex-ps-pdf/pscompress.ja.html http //jp.arxiv.org/help/bitmap/index#advanced 手書きepsの図作成関連 http //www.math.ubc.ca/~cass/graphics/manual/index.html http //www.cs.kyoto-wu.ac.jp/~konami/documents/ps/psmemo.html pdf分割・結合 http //www.atmarkit.co.jp/flinux/rensai/linuxtips/928splitpdf.html nページ目を切り出し pdftk in.pdf cat n output out.pdf mページ目からnページ目を切り出し pdftk in.pdf cat m-n output out.pdf 10ページ目削除 pdftk A=in.pdf cat A1-9 A11-end output out.pdf 全pdf結合 pdftk *.pdf cat output out.pdf pdfのパスワード解除 pdftk a.pdf input_pw YOUR_PASSWORD output b.pdf http //www-utheal.phys.s.u-tokyo.ac.jp/~yuasa/wiki/index.php/pdftk%E3%81%A7%E3%83%91%E3%82%B9%E3%83%AF%E3%83%BC%E3%83%89%E4%BB%98%E3%81%8DPDF%E3%82%92%E5%87%A6%E7%90%86%E3%81%97%E3%81%9F%E3%81%84 http //www.cyberciti.biz/faq/removing-password-from-pdf-on-linux/ gnuplotの図の入ったtex文書をdvipsで処理するとpdfinfoがバグる http //sourceforge.net/userapps/wordpress/soohyunc/2010/09/12/dvips-gnuplot-pdfinfo/ http //tug.org/pipermail/tex-k/2007-March/001675.html http //newsgroups.derkeiler.com/Archive/Comp/comp.graphics.apps.gnuplot/2007-02/msg00146.html http //www.latex-community.org/forum/viewtopic.php?f=5 t=16280 図の作成関連 gnuplotの図の修正 http //www26.atwiki.jp/titech-phys-kakomon/pages/44.html gnuplotでつくったsvgの図をInkscapeで編集 吐き出したsvgを処理する場合 http //www26.atwiki.jp/titech-phys-kakomon/pages/38.html#id_2f542da3 吐き出したepsを処理する場合 http //d.hatena.ne.jp/postmaster/20051116/1132115822 などにあるように pstoedit -f plot-svg input.eps output.svg とやってsvgをつくる。 吐き出したpdfを処理する場合 "-ssp" を指定 http //oku.edu.mie-u.ac.jp/~okumura/texfaq/qa/43337.html # 念のため言うと、最近のinkscapeはpdfを生で扱えるので # svgに直す必要はまったくない。 個人的な意見 フォントをいじらないなら、pdfをinkscapeで処理すればよい。 フォントをいじりたいなら、svgをgnuplotで吐き出す。 その際、 set term svg font "Nimbus Roman No9 L" とでも指定すればよい。残念ながら、ItalicとかBoldへの フォント変更はsvgを直接編集しないとダメっぽい。 こうして作成したinkscapeのsvgを編集後、epsを吐き出すと、 しばしばeps中のマイナスがハイフンになっている。具体的には、 「フォントを埋め込む（タイプ1のみ）」にチェックを入れると、マイナスがハイフンになる。 「フォントを埋め込む（タイプ1のみ）」にチェックを入れなければ、マイナスはマイナスのままである。 epsを確認すると、後者はISO Latin-1 encodingになっており、 ハイフンがマイナスとして無事に認識されている模様。 フォントの埋め込みがされていないのが嫌なら、 ps2pdf -dEPSCrop before.eps pdftops -eps before.pdf after.eps とでもしてください。 ちなみに、「『フォントを埋め込む（タイプ1のみ）』に チェックを入れない」という後者の操作は inkscape 0.46の場合、 inkscape --export-eps=hoge.eps hoge.svg に相当。 0.47以降は埋め込まないオプションが 削除されてるらしいので、 https //bugs.launchpad.net/inkscape/+bug/375323 「フォント埋め込まない」っていう方法では無理かも。 そのときは、svgファイルのハイフンを 地道にマイナスに置換するしかないかな。 # 参考までにinkscapeのcuiコマンド http //inkscape.paix.jp/manual/cmdline-usage.html gnuplotでつくったepsをtexでpdfにするときのフォント埋め込み gnuplotでつくったepsをtexでpdfにするとき、 Nimbus Roman No9 Lなどではなく、 Times Romanなどを埋め込みたい場合の話。 gs_pdfwr.psを編集する。 # ubuntu hardyでは # /usr/share/ghostscript/8.61/lib/gs_pdfwr.ps # ubuntu lucidでは # /usr/share/ghostscript/8.71/Resource/Init/gs_pdfwr.ps 下記のようにコメントアウトする。 /.standardfonts [ % /Courier /Courier-Bold /Courier-Oblique /Courier0BoldOblique % /Helvetica /Helvetica-Bold /Helvetica-Oblique /Helvetica-BoldOblique % /Times-Roman /Times-Bold /Times-Italic /Times-BoldItalic % /Symbol /ZapfDingbats ] readonly def # /AlwaysEmbedのバグのための対処療法？ # http //www.google.co.jp/search?hl=ja q=alwaysembed+bug aq=f aqi= aql= oq= gs_rfai= 参考： http //yuu-t.sakura.ne.jp/wiki/index.php?tex_memo http //jody.sci.hokudai.ac.jp/~ike/blog/2008/06/texpdf.html 図ではなく本文のフォント埋め込みは dvips linux dvips -Pdownload35 hoge.dvi windows dvips -Pdl hoge.dvi dvipdfmx linux dvipdfmx -f dvipdfm_dl14.map hoge.dvi windows dvipdfmx -f dlbase14.map hoge.dvi らしい。 # Nibus系のフォントがTimes系の代わりに埋め込まれるらしい。 # これだけだと図のフォントは埋め込まれない。 参考： http //www.kagami.org/diary/2007-08-15-1.html http //stickydiary.blog88.fc2.com/blog-entry-104.html https //gist.github.com/1040141 gnuplot等でフォントを埋め込んだepsの軽量化 gnuplotでフォントを埋め込んだ後のepsは結構重くなる。 一旦ps2pdfなどでpdfにしてから、 その後pdftopsでepsに戻すと軽くなる。 ps2pdf -dEPSCrop before.eps pdftops -eps before.pdf after.eps なお、pdf2psではなくて、xpdf付属のpdftopsを用いた方がよい。 埋め込もうとしているPostScriptの 代替フォントについては以下を見よ。 http //www.tg.rim.or.jp/~hexane/ach/hfw/hfwa3.htm フォント名は http //d.hatena.ne.jp/mashabow/20071216 や ghostscript/?.??/lib/Fontmap.GS で確認せよ。ubuntu hardyでは /usr/share/ghostscript/8.61/lib/Fontmap.GS にあった。中身はこんな感じ。 /URWBookmanL-DemiBold(b018015l.pfb); /URWBookmanL-DemiBoldItal(b018035l.pfb); /URWBookmanL-Ligh(b018012l.pfb); /URWBookmanL-LighItal(b018032l.pfb); /NimbusMonL-Regu(n022003l.pfb); /NimbusMonL-ReguObli(n022023l.pfb); /NimbusMonL-Bold(n022004l.pfb); /NimbusMonL-BoldObli(n022024l.pfb); /URWGothicL-Book(a010013l.pfb); /URWGothicL-BookObli(a010033l.pfb); /URWGothicL-Demi(a010015l.pfb); /URWGothicL-DemiObli(a010035l.pfb); /NimbusSanL-Regu(n019003l.pfb); /NimbusSanL-ReguItal(n019023l.pfb); /NimbusSanL-Bold(n019004l.pfb); /NimbusSanL-BoldItal(n019024l.pfb); /NimbusSanL-ReguCond(n019043l.pfb); /NimbusSanL-ReguCondItal(n019063l.pfb); /NimbusSanL-BoldCond(n019044l.pfb); /NimbusSanL-BoldCondItal(n019064l.pfb); /URWPalladioL-Roma(p052003l.pfb); /URWPalladioL-Ital(p052023l.pfb); /URWPalladioL-Bold(p052004l.pfb); /URWPalladioL-BoldItal(p052024l.pfb); /CenturySchL-Roma(c059013l.pfb); /CenturySchL-Ital(c059033l.pfb); /CenturySchL-Bold(c059016l.pfb); /CenturySchL-BoldItal(c059036l.pfb); /NimbusRomNo9L-Regu(n021003l.pfb); /NimbusRomNo9L-ReguItal(n021023l.pfb); /NimbusRomNo9L-Medi(n021004l.pfb); /NimbusRomNo9L-MediItal(n021024l.pfb); /StandardSymL(s050000l.pfb); /URWChanceryL-MediItal(z003034l.pfb); /Dingbats(d050000l.pfb); 多分、 Times-Roman - NimbusRomNo9L-Regu Times-Italic - NimbusRomNo9L-ReguItal Symbol - StandardSymL とかがあれば、論文の図をつくるのには十分。 eps中でフォント名が微妙に間違ってても それっぽいフォントが割り当てられてるんだけど…。 なんでだろう。 # 例えば Times-Italic - NimbusRomNo9L-Ital としても # ちゃんとTimes系のItalicフォントが割り当てられてた…。 参考： http //mytexpert.sourceforge.jp/index.php?pdftops http //www.atmarkit.co.jp/flinux/rensai/linuxtips/724pdf2ps.html gnuplotの色づかい http //とうごろう.jp/wiki/%E3%81%9D%E3%81%AE%E4%BB%96/Gnuplot%E3%81%A7Keynote%E9%A2%A8%E3%81%AE%E3%82%B0%E3%83%A9%E3%83%95%E3%82%92%E4%BD%9C%E6%88%90%E3%81%99%E3%82%8B/ http //d.hatena.ne.jp/peccu/20100210/gnuplot http //d.hatena.ne.jp/MegumiNiikura/20100127/1264601500 http //itoshi.tv/d/?date=20071001 kuler http //kuler.adobe.com/ 試作品 set style line 1 lt 1 lc rgbcolor "#7b0600" lw 4 ps 2 set style line 2 lt 1 lc rgbcolor "#ca5c00" lw 4 ps 2 set style line 3 lt 1 lc rgbcolor "#c29805" lw 4 ps 2 set style line 4 lt 1 lc rgbcolor "#a2b932" lw 4 ps 2 set style line 5 lt 1 lc rgbcolor "#267e17" lw 4 ps 2 set style line 6 lt 1 lc rgbcolor "#1aafff" lw 4 ps 2 set style line 7 lt 1 lc rgbcolor "#006ffe" lw 4 ps 2 set style line 8 lt 1 lc rgbcolor "#0021d2" lw 4 ps 2 set style line 9 lt 1 lc rgbcolor "#8b2bd3" lw 4 ps 2 set style line 10 lt 1 lc rgbcolor "#545857" lw 4 ps 2 set terminal postscript eps enhanced color set output "test10.ps" set size 0.8,0.8 set key left top set sample 10 set xrange [0 pi] set yrange [-1.5 2.0] plot \ sin(x - 0 * ((2 * pi) / 16)) ti "1" w lp ls 1, \ sin(x - 1 * ((2 * pi) / 16)) ti "2" w lp ls 2, \ sin(x - 2 * ((2 * pi) / 16)) ti "3" w lp ls 3, \ sin(x - 3 * ((2 * pi) / 16)) ti "4" w lp ls 4, \ sin(x - 4 * ((2 * pi) / 16)) ti "5" w lp ls 5, \ sin(x - 5 * ((2 * pi) / 16)) ti "6" w lp ls 6, \ sin(x - 6 * ((2 * pi) / 16)) ti "7" w lp ls 7, \ sin(x - 7 * ((2 * pi) / 16)) ti "8" w lp ls 8, \ sin(x - 8 * ((2 * pi) / 16)) ti "9" w lp ls 9, \ sin(x - 9 * ((2 * pi) / 16)) ti "10" w lp ls 10 ==== line colors ==== ---- 10 colors ---- #7b0600 #ca5c00 #c29805 #a2b932 #267e17 #1aafff #006ffe #0021d2 #8b2bd3 #545857 ---- 6 colors ---- #c60300 #ff8a1b #267e17 #006ffe #8b2bd3 #545857 ---- 7 colors ---- #ff0200 #ff8a1b #267e17 #0021d2 #8b2bd3 #2b3230 #545857 ---- 8 colors ---- #974F00 #FF2800 #FF8F00 #009800 #250097 #A800FF #52466C #000000 ==== surface colors ==== ---- 3 surfaces ---- #c1d2ff/#c1d5ff #d2fec7 #ffe2e3 ---- 2 lines ---- #ff1b1b #004bfe ---- 3 surfaces ---- #e4eaff #ffede4 #fffee4 ---- 3 lines ---- #c40501 #008111/#206b00 #206bff ---- 2 gray lines ---- #0f0f0f #a6a6a6/#bfbfbf gnuplotで中抜き（白塗り）のマーク eps出力でpoint typeを白で塗られたマークに変えたいときは、 以下をしかるべきところに追加すればOK。 # とりあえず、 ## /h {rlineto rlineto rlineto gsave fill grestore} bind def # /h {rlineto rlineto rlineto gsave closepath fill grestore} bind def # の下ぐらいにかけばいいんじゃない？ /CircleF { stroke [] 0 setdash gsave LCw setrgbcolor 2 copy hpt 0 360 arc fill grestore hpt 0 360 arc stroke } def /BoxF { stroke [] 0 setdash gsave LCw setrgbcolor 2 copy exch hpt sub exch vpt add M 0 vpt2 neg V hpt2 0 V 0 vpt2 V hpt2 neg 0 V closepath fill grestore exch hpt sub exch vpt add M 0 vpt2 neg V hpt2 0 V 0 vpt2 V hpt2 neg 0 V closepath stroke } def /TriUF { stroke [] 0 setdash gsave LCw setrgbcolor 2 copy vpt 1.12 mul add M hpt neg vpt -1.62 mul V hpt 2 mul 0 V hpt neg vpt 1.62 mul V closepath fill grestore vpt 1.12 mul add M hpt neg vpt -1.62 mul V hpt 2 mul 0 V hpt neg vpt 1.62 mul V closepath stroke } def /TriDF { stroke [] 0 setdash gsave LCw setrgbcolor 2 copy vpt 1.12 mul sub M hpt neg vpt 1.62 mul V hpt 2 mul 0 V hpt neg vpt -1.62 mul V closepath fill grestore vpt 1.12 mul sub M hpt neg vpt 1.62 mul V hpt 2 mul 0 V hpt neg vpt -1.62 mul V closepath stroke } def /DiaF { stroke [] 0 setdash gsave LCw setrgbcolor 2 copy vpt add M hpt neg vpt neg V hpt vpt neg V hpt vpt V hpt neg vpt V closepath fill grestore vpt add M hpt neg vpt neg V hpt vpt neg V hpt vpt V hpt neg vpt V closepath stroke } def /PentF { stroke [] 0 setdash gsave LCw setrgbcolor 2 copy gsave translate 0 hpt M 4 {72 rotate 0 hpt L} repeat closepath fill grestore grestore gsave translate 0 hpt M 4 {72 rotate 0 hpt L} repeat closepath stroke grestore } def ちなみに、これらは http //とうごろう.jp/wiki/%E3%81%9D%E3%81%AE%E4%BB%96/Gnuplot%E3%81%A7Keynote%E9%A2%A8%E3%81%AE%E3%82%B0%E3%83%A9%E3%83%95%E3%82%92%E4%BD%9C%E6%88%90%E3%81%99%E3%82%8B/ http //d.hatena.ne.jp/peccu/20100210/gnuplot のソースのパクリ。 マークの白抜きの部分に色をつけたい場合は、 gsave LCw setrgbcolor 2 copy のLCWを{0 0 0}や{1 1 1}といったrgb colorに置き換えればよい。 gnuplotで掛け算記号 http //t16web.lanl.gov/Kawano/gnuplot/tics.html#3.5 は{/Symbol \327} ×は{/Symbol \264} グラフからデータの抽出 g3data http //www.frantz.fi/software/g3data.php Engauge Digitizer http //digitizer.sourceforge.net/ gnuplot以外の選択肢 http //matplotlib.sourceforge.net/ # http //packages.ubuntu.com/ja/hardy/python-matplotlib http //asymptote.sourceforge.net/ http //plasma-gate.weizmann.ac.il/Grace/ http //gri.sourceforge.net/ http //pyx.sourceforge.net/ 非常に参考になるサイト http //t16web.lanl.gov/Kawano/gnuplot/ http //www.ss.scphys.kyoto-u.ac.jp/person/yonezawa/contents/program/gnuplot/index.html http //wwwnucl.ph.tsukuba.ac.jp/contents/member/inakura/gnuplot/gnuplot.html http //ryukyu.astr.tohoku.ac.jp/pukiwiki/index.php?Members%2Fchinone%2F%B3%D0%BD%F1%2FGnuplot http //www.phyast.pitt.edu/~zov1/gnuplot/html/intro.html http //gnuplot-tricks.blogspot.com/ http //gnuplot.sourceforge.net/scripts/index.html#postprocess-postscript http //www.gnuplotting.org/ http //gnuplot-surprising.blogspot.jp/ C language memo fgets + sscanf http //d.hatena.ne.jp/eel3/20080810/1228919543 http //detail.chiebukuro.yahoo.co.jp/qa/question_detail/q1122240656 malloc http //d.hatena.ne.jp/tondol/20090713/1247426321 http //handasse.blogspot.com/2009/02/cc.html mpi # sudo apt-get install lam-runtime lam4-dev lam-mpidoc # lamboot http //ubuntuforums.org/showthread.php?t=993389 # lamclean http //www.linuxquestions.org/questions/programming-9/parallell-programming-w-mpi-375559/ lapack gcc in ubuntu gcc a.c -lm -llapack -o a_out icc disable annoying remarks To disable "remark #981 operands are evaluated in unspecified order" icc -c main.c -O3 -Wall -wd981 http //software.intel.com/en-us/forums/showthread.php?t=46883 shell command memo http //www.8wave.net/unix_text.html http //awk.info/?awk1line bash/csh：標準出力と標準エラー出力 http //homepage2.nifty.com/freeline/bash_vs_csh.html http //x68000.q-e-d.net/~68user/unix/pickup?%A5%EA%A5%C0%A5%A4%A5%EC%A5%AF%A5%C8 shでファイル名を取得 Sample1 http //d.hatena.ne.jp/te2u/20090327/p1 #!/bin/bash path="/path/to/foo.tar.gz" echo "path $path" basename=${path##*/} echo "basename $basename" filename=${basename%.*} echo "filename $filename" extension=${basename##*.} echo "extension $extension" Sample2 http //sonic64.com/2006-02-27.html #!/bin/sh echo "This script name is $0" echo "This script name is `basename $0`" echo "This script name is ${0##*/}" echo "This script name is ${0#*/}" bashで小数演算（bc使用） a=`echo "scale=7; 133.1/4.25" | bc` echo ${a} 整数部分の0も表示させたいなら、例えば b=`echo "scale=4; 133.1/4.25" | bc | sed -e "s/^\./0./" | sed -e "s/^0$/0.0000/"` echo ${b} とする。 http //www.booran.com/menu/scr/math.html http //oshiete.goo.ne.jp/qa/5345605.html awkコマンドに引数を渡す方法 シングルクォートで囲むだけ。 http //oshiete.goo.ne.jp/qa/3482584.html awkで文頭が#の行を削除 awk $1 !~ /#/{print $0} [filename] http //www.legacyst.com/naotokun/past/unixer/cmp_awk.html#condition http //www.wikihouse.com/torowiki/index.php?awk#x55d7b7b #の行を表示させる場合は awk $1 ~ /#/{print $0} [filename] find+exec/find+xargs ~/work/ directoryのfileをすべてtouchする。 find ~/work/ -exec touch {} \; より高速： find ~/work/ | xargs touch ファイル名にスペースがあるとき： find ~/work/ -print0 | xargs -0 touch wget 例えば、pdfが欲しいとき。 wget -r -l 1 -A pdf http //www.hoge/ http //jp.layer8.sh/reference/entry/show/id/1007 arXiv.orgのソースの展開 http //arxiv.org/help/unpack ファイルはtarらしい。 tar -xvf filename.tar rsync http //d.hatena.ne.jp/koseki2/20090424/rsync io errorでも強制的に--deleteしたいときは--ignore-errorsをつける。 web, css関連 validator http //validator.w3.org/ http //jigsaw.w3.org/css-validator/ 画像の使用を極力控えてかっこいいCSSデザインをやってみよう大会 http //www.jam-graffiti.com/non-pic-css/ twitter関連 ログ保存 http //www.moonmile.net/blog/archives/860より引用。 #!/usr/bin/perl # 指定アカウントの全発言を取得 $user = $ARGV[0]; # アカウント $wget = "wget"; if ( $user eq "" ) { print "perl krmall.pl [アカウント]\n"; exit; } # 現在のツイート数を取得 `$wget http //twitter.com/$user -Otemp.txt`; open( FILE, " temp.txt" ); while( FILE ) { if ( / span id="update_count" class="stat_count" ([0-9,]+) \/span / ) { $cnt = $1; $cnt =~ s/,//; break; } } close( FILE ); $pmax = int($cnt/20)+1; print "account $user count $cnt pages $pmax\n"; # 指定アカウントを全て読み込み unlink( "$user.txt" ); open( OUT, " $user.txt" ); for ($i=1; $i =$pmax; $i++ ) { `$wget http //twitter.com/$user?page=$i -Otemp.txt`; open( FILE, " temp.txt" ); while( FILE ) { if ( / span class="entry-content" / ) { $text = $_; if ( !/ \/span / ) { while( FILE ) { if ( / \/span / ) { $text .= $_; last; } $text .= $_; } } $text =~ s/\n//g; $text =~ s/\r//g; $text =~ / span class="entry-content" (.*) \/span /; $text = $1; FILE ; FILE ; $id = FILE ; $id =~ /status\/([0-9]+)/; $id = $1; $date = FILE ; $date =~ /data="{time ([^ ]+) }/; #" $date = $1; $text =~ s/ [^ ]+ //g; print OUT "---\n"; print OUT "$id\n"; print OUT "$text\n"; print OUT "$date\n\n"; } } close( FILE ); } close( OUT ); # " # 統計表示 open( OUT, " $user.txt"); open( ST, " ${user}_st.txt"); while( OUT ) { if ( /^---/ ) { $_ = OUT ; chomp; $id = $_; $_ = OUT ; chomp; $text = $_; $_ = OUT ; chomp; $date = $_; $_ = $text ; @res = /(@[A-Za-z0-9_]+)/g; foreach $re ( @res ) { $users{ $re } = $users{ $re } + 1; } } } close( OUT ); foreach $re ( sort {$users{$b} = $users{$a}} keys %users ) { if ( $re ne "@".$user ) { print ST "$re (".$users{$re}.")\n"; } } close( ST ); タイムライン関連のAPI /user_timeline http //wiki.tmd45.in/wiki.cgi?page=Twitter%A5%C9%A5%AD%A5%E5%A5%E1%A5%F3%A5%C8%2F%A5%BF%A5%A4%A5%E0%A5%E9%A5%A4%A5%F3%B4%D8%CF%A2%A4%CEAPI#p5 twitter ubuntu クライアント http //gihyo.jp/admin/serial/01/ubuntu-recipe/0071 Echofon https //addons.mozilla.org/ja/firefox/addon/5081/eula/104941?src=addondetail TwitterBar https //addons.mozilla.org/ja/firefox/addon/4664/ "コメント --post"で投稿可。 twitte.rb http //ichi.mo-blog.jp/tedious/twitterb/index.html # もう使えない？ http //ubulog.blogspot.com/2009/03/ubuntu-twitter.html http //sourceforge.jp/projects/twitte-rb/wiki/FrontPage http //sourceforge.jp/projects/twitte-rb/wiki/twitte.rb%E3%81%AE%E4%BD%BF%E7%94%A8%E6%96%B9%E6%B3%95 sudo apt-get install libglade2-ruby libgconf2-ruby libopenssl-ruby mitter http //d.hatena.ne.jp/morphine57/20091113 https //launchpad.net/~ikuya-fruitsbasket/+archive/ppa http //ppa.launchpad.net/ikuya-fruitsbasket/ppa/ubuntu/pool/main/m/mitter/
https://w.atwiki.jp/todo314/pages/20.html
お役立ち情報 スケジュール https //confsearch.ethz.ch/?query=STOC+FOCS+SODA+CCC+ICALP+ITCS+LICS+IPCO+ISSAC+SoCG+PODS+COLT+EC+ESA+STACS+APPROX+RANDOM+MFCS+SWAT+WADS+ISAAC+FUN http //www.conferencelist.info/upcoming.html http //community.dur.ac.uk/tom.friedetzky/conf.html http //www.lix.polytechnique.fr/~hermann/conf.html http //csconf.net/deadlines 国際会議・雑誌 MSAR field ratings (2014) http //www.conferenceranks.com/visualization/msar2014.html Google scholar Top publications https //scholar.google.com/citations?view_op=top_venues vq=eng_theoreticalcomputerscience Ranking of CS Departments based on the Number of Papers in Theoretical Computer Science https //projects.csail.mit.edu/dnd/ranking/ Computer Science Conference Rankings https //webdocs.cs.ualberta.ca/~zaiane/htmldocs/ConfRanking.html Acceptance ratio of some Theoretical Computer Science Conferences https //www.lamsade.dauphine.fr/~sikora/ratio/confs.php ML-DM-AI Papers by Researchers in Japan https //knuu.github.io/pages/ml-dm-ai_jp_papers.html Conference Ranks http //www.conferenceranks.com/ Acceptance rates for the top-tier AI-related conferences https //github.com/lixin4ever/Conference-Acceptance-Rate https //perso.crans.org/genest/conf.html https //www.aminer.org/ranks/conf Computer Science Conference Rankings https //dsl.cds.iisc.ac.in/publications/CS_ConfRank.htm Journals (etc.) in Discrete Mathematics and related fields http //www.math.iit.edu/~kaul/Journals.html List of TCS conferences and workshops https //cstheory.stackexchange.com/questions/7900/list-of-tcs-conferences-and-workshops GII-GRIN-SCIE (GGS) Conference Rating http //www.consorzio-cini.it/gii-grin-scie-rating.html CORE Computer Science Journal Rankings http //cic.tju.edu.cn/faculty/zhileiliu/doc/COREComputerScienceJournalRankings.html Computer Science Conference Rank https //www.camille-kurtz.com/index_fichiers/html/CSRank.html CORE Conference Portal http //portal.core.edu.au/conf-ranks/ CORE Journal Portal http //portal.core.edu.au/jnl-ranks/ 中国计算机学会推荐 https //www.ccf.org.cn/Academic_Evaluation/By_category/ 清华大学计算机学科群 推荐学术会议和期刊列表 https //numbda.cs.tsinghua.edu.cn/~yuwj/TH-CPL.pdf 清华大学交叉信息研究院 重要国际学术会议及核心期刊 https //iiis.tsinghua.edu.cn/uploadfile/cs_conference_list.pdf 頂尖國際會議表列 https //www.csie.ncu.edu.tw/file/98ef5b203937077d24098c335abcf0ca 计算机学术期刊排名 https //sites.google.com/site/luzhaoshomepage/Home/journal-list/ji-suan-ji-xue-shu-qi-kan-pai-ming-computer-science-journal-rankings まとめサイト Best Paper Awards in Computer Science (since 1996) http //jeffhuang.com/best_paper_awards.html データベース勉強会Wiki http //www.kde.cs.tsukuba.ac.jp/dbreading/ Statistics of acceptance rate for the main AI conferences https //github.com/lixin4ever/Conference-Acceptance-Rate Hot Topics on Big Data Algorithms, Analytics and Applications https //www.cse.ust.hk/~leichen/courses/comp6311D/ http //akoide.hatenablog.com/ http //www.orgnet.com/hijackers.html http //11011110.livejournal.com/260838.html http //www.ipsj.or.jp/journal/info/75NC.html 専門知識の仕入れ方 by 吉田さん http //research.preferred.jp/2011/09/how-to-learn/ 岩間研の輪講 http //www.lab2.kuis.kyoto-u.ac.jp/fswikiout/wiki.cgi?action=LIST Laplacian Linear Equations, Graph Sparsification, Local Clustering, Low-Stretch Trees, etc. https //sites.google.com/a/yale.edu/laplacian/ Combinatorial Reconfiguration Wiki http //reconf.wikidot.com/ Connected Papers https //www.connectedpapers.com/ 英語論文の査読表現集 https //staff.aist.go.jp/a.ohta/japanese/study/Review_ex_top.htm Computational Intractability A Guide to Algorithmic Lower Bounds https //hardness.mit.edu/ What Books Should Everyone Read? https //cstheory.stackexchange.com/questions/3253/what-books-should-everyone-read Mathematical Writing by. Donald E. Knuth, Tracy Larrabee, and Paul M. Roberts https //jmlr.csail.mit.edu/reviewing-papers/knuth_mathematical_writing.pdf 講義 PCP and hardness of approximation 解説とか On Dinur s Proof of the PCP Theorem https //www.ams.org/journals/bull/2007-44-01/S0273-0979-06-01143-8/S0273-0979-06-01143-8.pdf クラスNPの新しい特徴づけ https //ipsj.ixsq.nii.ac.jp/ej/index.php?action=pages_view_main active_action=repository_action_common_download item_id=4159 item_no=1 attribute_id=1 file_no=1 page_id=13 block_id=8 https //cstheory.stackexchange.com/questions/45/what-are-good-references-to-understanding-the-proof-of-the-pcp-theorem https //www.cs.umd.edu/~gasarch/TOPICS/pcp/pcp.html https //sites.google.com/view/pcpfest/program Approximability of Optimization Problems (1999?, Madhu Sudan) http //people.csail.mit.edu/madhu/FT99/course.html ( low-degree test ) 😋CSE 532 Computational Complexity Essentials (2004, Paul Beame) https //courses.cs.washington.edu/courses/cse532/04sp/ ( low-degree test ) 😋CSE 533 The PCP Theorem and Hardness of Approximation (2005, Venkatesan Guruswami Ryan O Donnell) https //courses.cs.washington.edu/courses/cse533/05au/ (Dinur s proof) CS 294 PCP and Hardness of Approximation (2006, Luca Trevisan) https //cs.stanford.edu/people/trevisan/pcp/ (講義録少) 😋Course 236603 Probabilistically Checkable Proofs (2007, Eli Ben-Sasson) https //eli.net.technion.ac.il/files/2013/03/notes_2007_Fall.pdf (PCPP; robust PCP) CS359 Hardness of Approximation (Tim Roughgarden, 2007) https //timroughgarden.org/w07b/w07b.html (講義録少) 😋15-854(B) Advanced Approximation Algorithms (2008, Anupam Gupta Ryan O Donnell) https //www.cs.cmu.edu/~anupamg/adv-approx/ 😋6.895 Probabilistically Checkable Proofs and Hardness of Approximation (2010, Dana Moshkovitz) https //www.cs.utexas.edu/~danama/courses/pcp-mit/index.html ( low-degree test ) Prahladh Harsha CMSC 39600 PCPs, codes and inapproximability (2007, Prahladh Harsha) https //www.tifr.res.in/~prahladh/teaching/07autumn/ (講義録少) 😋Limits of approximation algorithms PCPs and Unique Games (2009―10, Prahladh Harsha) https //www.tifr.res.in/~prahladh/teaching/2009-10/limits/ ( low-degree test ) PCPs and Limits of approximation algorithms (2014―15, Prahladh Harsha) https //www.tifr.res.in/~prahladh/teaching/2014-15/limits/ (講義録少) Approximation Algorithms and Hardness of Approximation (2013, Ola Svensson Alantha Newman) https //theory.epfl.ch/osven/courses/Approx13/ (Dinur s proof) 😋CS294 Probabilistically Checkable and Interactive Proof Systems (2019, Alessandro Chiesa) http //people.eecs.berkeley.edu/~alexch/classes/CS294-S2019.html ( 講義動画神 , low-degree test) 15-859T A Theorist s Toolkit (2013, Ryan O Donnell) http //www.cs.cmu.edu/~odonnell/toolkit13/ Algorithmic Lower Bounds Fun with Hardness Proofs (2014/2019, Erik Demaine) https //ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-890-algorithmic-lower-bounds-fun-with-hardness-proofs-fall-2014/index.htm http //courses.csail.mit.edu/6.892/spring19/lectures/ CS395T Pseudorandomness (2017, David Zuckerman) https //www.cs.utexas.edu/~diz/395T/17/ Pseudorandomness (Salil Vadhan, monograph) https //people.seas.harvard.edu/~salil/pseudorandomness/ Expander graphs Expander Graphs and their applications (2020, Irit Dinur) https //www.wisdom.weizmann.ac.il/~dinuri/courses/20-expanders/index.htm Expander Graphs in Computer Science (2010, He Sun) https //resources.mpi-inf.mpg.de/departments/d1/teaching/ws10/EG/WS10.html Course 67659 Expander graphs and their applications (2002, Nati Linial Avi Wigderson) https //www.boazbarak.org/expandercourse/ Counting and Sampling Markov Chain Monte Carlo Methods (2006, Eric Vigoda) https //www.cc.gatech.edu/~vigoda/MCMC_Course/ CSE 599 Counting and Sampling (2017, Shayan Oveis Gharan) https //homes.cs.washington.edu/~shayan/courses/sampling/ CS 294 Markov Chain Monte Carlo Foundations Applications, (Alistair Sinclair) https //people.eecs.berkeley.edu/~sinclair/cs294/f09.html CS294-180 Partition Functions Algorithms Complexity (2020, Alistair Sinclair) https //people.eecs.berkeley.edu/~sinclair/cs294/f20.html CSE 599 Polynomial Paradigm in Algorithm Design (2020, Shayan Oveis Gharan) https //homes.cs.washington.edu/~shayan/courses/polynomials/ Math 270 The Geometry of Polynomials in Algorithms, Combinatorics, and Probability (2015, Nikhil Srivastava) https //math.berkeley.edu/~nikhil/courses/270/ Bridging Continuous and Discrete Optimization (2017) https //simons.berkeley.edu/programs/optimization2017 Geometry of Polynomials https //simons.berkeley.edu/programs/geometry2019 Counting and Sampling (2020, EPFL) https //www.epfl.ch/schools/ic/tcs/counting-and-sampling-2020/ Markov Chains and Counting (Alan Frieze, book) https //www.math.cmu.edu/~af1p/Teaching/MCC17/MC.html Others Parameterized Complexity (2019, Saket Saurabh) https //sites.google.com/view/sakethome/teaching/parameterized-complexity Proofs, beliefs, and algorithms through the lens of sum-of-squares https //www.sumofsquares.org/public/index.html Stat260/CompSci294 Topics in Spectral Graph Methods (Michael Mahoney) https //www.stat.berkeley.edu/~mmahoney/s15-stat260-cs294/ Topics in Theoretical Computer Science An Algorithmist s Toolkit (Jonathan Kelner) https //ocw.mit.edu/courses/mathematics/18-409-topics-in-theoretical-computer-science-an-algorithmists-toolkit-fall-2009/ 6.889 Algorithms for Planar Graphs and Beyond (Fall 2011) http //courses.csail.mit.edu/6.889/fall11/lectures/ 15-855 Graduate Computational Complexity Theory (2017, Ryan O Donnell) http //www.cs.cmu.edu/~odonnell/complexity17/ その他 Journals with quick reviewing - Theoretical Computer Science Stack Exchange https //cstheory.stackexchange.com/questions/8335/journals-with-quick-reviewing Backlog of MathematicsResearch Journals https //www.ams.org/journals/notices/201810/rnoti-p1289.pdf Online TCS Seminars https //cstheory.stackexchange.com/questions/46930/online-tcs-seminars Algorithms Randomization Computation https //sites.google.com/di.uniroma1.it/arc/home Felix Reidl https //tcs.rwth-aachen.de/~reidl/ https //rjlipton.wordpress.com/2014/12/21/modulating-the-permanent/ https //barthesi.gricad-pages.univ-grenoble-alpes.fr/personal-website/dpps/2018-26-11-dpps_intro/ Thirty-Three Miniatures Mathematical and Algorithmic Applications of Linear Algebra https //kam.mff.cuni.cz/~matousek/stml-53-matousek-1.pdf Research in Progress https //researchinprogress.tumblr.com/ 情報拡散 投票者モデル A model for spatial conflict Biometrika 1973 Ergodic theorems for weakly interacting infinite systems and the voter model Annals of Probability 1975. Influence Maximization 関連 バイラルマーケティング Mining the Network Value of Customers Mining Knowledge-Sharing Sites for Viral Marketing 元ネタ Maximizing the Spread of Influence through a Social Network 理論的結果 On the Approximability of Influence in Social Networks 影響最大化／影響力推定の爆速アルゴリズム シミュレーション CELF++ Optimizing the Greedy Algorithm for Influence Maximization in Social ... WWW 2011 Efficient Influence Maximization in Social Networks KDD 2009 StaticGreedy Solving the Scalability-Accuracy Dilemma in Influence Maximization CIKM 2013 UBLF An Upper Bound Based Approach to Discover Influential Nodes in Social ... ICDM 2013 An Upper Bound based Greedy Algorithm for Mining Top-k Influential Nodes in ... WWW 2014 Extracting Influential Nodes for Information Diffusion on a Social Network AAAI 2007 IMGPU GPU-Accelerated Influence Maximization in Large-Scale Social Networks TPDS 2014 Influence Maximization in Big Networks An Incremental Algorithm for ... IJCAI 2015 Influence at Scale Distributed Computation of Complex Contagion in Networks KDD 2015 Outward Influence and Cascade Size Estimation in Billion-scale Networks SIGMETRICS 2017 RIS Maximizing Social Influence in Nearly Optimal Time SODA 2014 Influence Maximization Near-Optimal Time Complexity Meets Practical Efficiency SIGMOD 2014 Social Influence Spectrum with Guarantees Computing More in Less Time CSoNet 2015 Influence Maximization in Near-Linear Time A Martingale Approach SIGMOD 2015 Cost-aware Targeted Viral Marketing in Billion-scale Networks INFOCOM 2016 Stop-and-Stare Optimal Sampling Algorithms for Viral Marketing in ... SIGMOD 2016 Revisiting the Stop-and-Stare Algorithms for Influence Maximization PVLDB 2017 Why approximate when you can get the exact? Optimal Targeted Viral Marketing ... INFOCOM 2017 Importance Sketching of Influence Dynamics in Billion-scale Networks ICDM 2017 ヒューリスティクス Scalable Influence Maximization for Prevalent Viral Marketing in Large-Scale ... KDD 2010 Scalable Influence Maximization in Social Networks under the Linear ... ICDM 2010 IRIE Scalable and Robust Influence Maximization in Social Networks ICDM 2012 Simulated Annealing Based Influence Maximization in Social Networks AAAI 2011 On Approximation of Real-World Influence Spread PKDD 2012 Scalable and Parallelizable Processing of Influence Maximization for ... ICDE 2013 Simpath An Efficient Algorithm for Influence Maximization under the Linear ... ICDM 2011 Probabilistic Solutions of Influence Propagation on Networks CIKM 2013 Community-based Greedy Algorithm for Mining Top-K Influential Nodes in ... KDD 2010 Efficient algorithms for influence maximization in social networks KAIS 2012 CINEMA Conformity-Aware Greedy Algorithm for Influence Maximization in ... EDBT 2013 A Novel and Model Independent Approach for Efficient Influence Maximization ... WISE 2013 Influence Spread in Large-Scale Social Networks - A Belief Propagation Approach ECML PKDD 2012 IMRank Influence Maximization via Finding Self-Consistent Ranking SIGIR 2014 ASIM A Scalable Algorithm for Influence Maximization under the Independent ... WWW 2015 Holistic Influence Maximization Combining Scalability and Efficiency with ... SIGMOD 2016 影響拡散高速計算 Efficient influence spread estimation for influence maximization under the ... Exact Computation of Influence Spread by Binary Decision Diagrams WWW 2017 Computing and maximizing influence in linear threshold and triggering models NIPS 2016 その他 Influence Maximization in Undirected Networks SODA 2014 Debunking the Myths of Influence Maximization An In-Depth Benchmarking Study SIGMOD 2017 謎 Maximizing the Spread of Cascades Using Network Design UAI 2010 The complexity of influence maximization problem in the deterministic linear ... JCO 2012 目的関数が違う Personalized Influence Maximization on Social Networks Stability of Influence Maximization Minimizing Seed Set Selection with Probabilistic Coverage Guarantee in a ... On minimizing budget and time in influence propagation over social networks Minimizing Seed Set for Viral Marketing Online Influence Maximization Minimum-Cost Information Dissemination in Social Networks Robust Influence Maximization (He-Kempe) Robust Influence Maximization (Chen+) Robust Influence Maximization (Lowalekar+) Spheres of Influence for More Effective Viral Marketing 変種設定 インターネット広告 Real-time Targeted Influence Maximization for Online Advertisements VLDB 2015 Viral Marketing Meets Social Advertising Ad Allocation with Minimum Regret VLDB 2015 Revenue Maximization in Incentivized Social Advertising VLDB 2017 疎化・粗大化 Sparsification of Influence Networks Fast Influence-based Coarsening for Large Networks 予測 Prediction of Information Diffusion Probabilities for Independent Cascade Model Learning Continuous-Time Information Diffusion Model for Social Behavioral ... Learning Influence Probabilities In Social Networks Learning Stochastic Models of Information Flow Predicting Information Diffusion on Social Networks with Partial Knowledge Latent Feature Independent Cascade Model for Social Propagation Learning Diffusion Probability based on Node Attributes in Social Networks Topic-aware Social Influence Propagation Models Uncovering the Temporal Dynamics of Diffusion Networks モデリング 時間 A Data-Based Approach to Social Influence Maximization Time-Critical Influence Maximization in Social Networks with Time-Delayed ... Time Constrained Influence Maximization in Social Networks Uncovering the Temporal Dynamics of Diffusion Networks On Influential Node Discovery in Dynamic Social Networks Influence Maximization with Novelty Decay in Social Networks トピック・カテゴリ Topic-aware Social Influence Propagation Models Diversified Social Influence Maximization モデルは同じ，目的関数が違う トピック・カテゴリのアルゴリズム Online Topic-aware Influence Maximization Queries EDBT 2014 Real-time Topic-aware Influence Maximization Using Preprocessing CSoNet 2015 Online Topic-Aware Influence Maximization VLDB 2015 負/競合 Competitive Influence Maximization in Social Networks WINE 2007 Word of Mouth Rumor Dissemination in Social Networks SIROCCO 2008 Threshold Models for Competitive Influence in Social Networks WINE 2010 Influence Maximization in Social Networks When Negative Opinions May Emerge ... Influence Blocking Maximization in Social Networks under the Competitive ... Maximizing Influence in a Competitive Social Network A Follower s Perspective ICEC 2007 New Models for Competitive Contagion Opinion maximization in social networks 意見 Maximizing Influence in an Ising Network A Mean-Field Optimal Solution Isingモデル 投票者モデル オリジナル Ergodic Theorems for Weakly Interacting Infinite Systems and the Voter Model A Model for Spatial Conflict A Note on Maximizing the Spread of Influence in Social Networks WINE 2007 Influence Diffusion Dynamics and Influence Maximization in Social Networks ... WSDM 2013 Maximizing the Long-term Integral Influence in Social Networks Under the ... WWW 2014 適応的二段階アプローチ Scalable Methods for Adaptively Seeding a Social Network WWW 2015 その他 How to Influence People with Partial Incentives Mining Social Networks Using Heat Diffusion Processes for Marketing ... Influence Maximization with Viral Product Design Profit Maximization over Social Networks On Budgeted Influence Maximization in Social Networks In Search of Influential Event Organizers in Online Social Networks Linear Computation for Independent Social Influence Efficient Location-Aware Influence Maximization Dynamic Influence Maximization Under Increasing Returns to Scale Online Influence Maximization Real-time Targeted Influence Maximization for Online Advertisements VLDB 2015 連続時間独立カスケード(CT-IC)モデル Uncovering the Temporal Dynamics of Diffusion Networks ICML 2011 Influence Maximization in Continuous Time Diffusion Networks ICML 2012 Scalable Influence Estimation in Continuous-Time Diffusion Networks NIPS 2013 Tight Bounds for Influence in Diffusion Networks and Application to Bond ... NIPS 2014 Anytime Influence Bounds and the Explosive Behavior of Continuous-Time ... NIPS 2015 汚染最小化 Minimizing the Spread of Contamination by Blocking Links in a Network Blocking Links to Minimize Contamination Spread in a Social Network Negative Influence Minimizing by Blocking Nodes in Social Networks Finding Spread Blockers in Dynamic Networks 動的アルゴリズム Influence Maximization in Dynamic Social Networks Maximizing the Extent of Spread in a Dynamic Network On Influential Nodes Tracking in Dynamic Social Networks Real-Time Influence Maximization on Dynamic Social Streams PVLDB 2017 斉藤 和巳さん一派 Tractable Models for Information Diffusion in Social Networks PKDD 2006 Extracting Influential Nodes for Information Diffusion on a Social Network AAAI 2007 Minimizing the Spread of Contamination by Blocking Links in a Network AAAI 2008 Prediction of Information Diffusion Probabilities for Independent Cascade Model KES 2008 Learning Continuous-Time Information Diffusion Model for Social Behavioral ... ACML 2009 Selecting Information Diffusion Models over Social Networks for Behavioral ... ECML PKDD 2010 (ACML 09と同じ？) Blocking Links to Minimize Contamination Spread in a Social Network TKDD 2009 Finding Influential Nodes in a Social Network from Information Diffusion Data SBP 2009 Learning information diffusion model in a social network for predicting influence of nodes Intell. Data Anal. 2011 Learning Diffusion Probability based on Node Attributes in Social Networks ISMIS 2011 Uncertain Graphs On a Routing Problem Within Probabilistic Graphs ... INFOCOM 2007 The Most Reliable Subgraph Problem PKDD 2007 Frequent Subgraph Pattern Mining on Uncertain Graph Data CIKM 2009 Fast Discovery of Reliable Subnetworks ASONAM 2010 k-Nearest Neighbors in Uncertain Graphs VLDB 2010 Finding Top-k Maximal Cliques in an Uncertain Graph ICDE 2010 Fast Discovery of Reliable k-terminal Subgraphs PAKDD 2010 Discovering Frequent Subgraphs over Uncertain Graph Databases under ... KDD 2010 BMC An Efficient Method to Evaluate Probabilistic Reachability Queries DASFAA 2011 Efficient Discovery of Frequent Subgraph Patterns in Uncertain Graph Databases EDBT 2011 Discovering Highly Reliable Subgraphs in Uncertain Graphs KDD 2011 Distance Constraint Reachability Computation in Uncertain Graphs VLDB 2011 Efficient Subgraph Search over Large Uncertain Graphs VLDB 2011 Reliable Clustering on Uncertain Graphs ICDM 2012 Polynomial-Time Algorithm for Finding Densest Subgraphs in Uncertain Graphs MLG 2013 Clustering Large Probabilistic Graphs TKDE 2013 The Pursuit of a Good Possible World Extracting Representative Instances of ... SIGMOD 2014 Efficient and Accurate Query Evaluation on Uncertain Graphs via Recursive ... ICDE 2014 Fast Reliability Search in Uncertain Graphs EDBT 2014 Top-k Reliable Edge Colors in Uncertain Graphs CIKM 2015 Top-k Reliability Search on Uncertain Graphs ICDM 2015 Assessing Attack Vulnerability in Networks with Uncertainty INFOCOM 2015 Triangle-Based Representative Possible Worlds of Uncertain Graphs DASFAA 2016 Truss Decomposition of Probabilistic Graphs Semantics and Algorithms SIGMOD 2016 ネットワーク信頼性 A practical bounding algorithm for computing two-terminal reliability based ... Comput. Math. Appl. 2011 OR系 Minimum-Risk Maximum Clique Problem k-means Streaming k-means approximation StreamKM++ A Clustering Algorithm for Data Streams k-means++ The Advantages of Careful Seeding Streaming k-means on Well-Clusterable Data A Local Search Approximation Algorithm for k-Means Clustering Fast and Accurate k-means For Large Datasets Hartigan s Method k-means Clustering without Voronoi Hartigan s K-Means Versus Lloyd s K-Means - Is It Time for a Change? Using the Triangle Inequality to Accelerate k-Means Making k-means even faster Accelerated k-means with adaptive distance bounds PageRank 高速計算 Extrapolation Methods for Accelerating PageRank Computations FAST-PPR Scaling Personalized PageRank Estimation for Large Graphs 動的更新 Link Evolution Analysis and Algorithms Fast Incremental and Personalized PageRank PageRank on an Evolving Graph Efficient PageRank Tracking in Evolving Networks 私，前原貴憲，河原林健一 バックボタン The Effect of the Back Button in a Random Walk Application for PageRank BackRank an Alternative for PageRank? Spectral Clustering A Random Walks View of Spectral Segmentation Kernel k-means, Spectral Clustering and Normalized Cuts http //ranger.uta.edu/~chqding/Spectral/ https //arxiv.org/abs/0711.0189 A Tutorial on Spectral Clustering. Ulrike von Luxburg Laplacian https //sites.google.com/a/yale.edu/laplacian/ 理論計算機科学 + ... ACM Symposium on Theory of Computing STOC 2013 Fast Approximation Algorithms for the Diameter and Radius of Sparse Graphs STOC 2014 The matching polytope has exponential extension complexity Approximation Algorithms for Regret-Bounded Vehicle Routing and Applications ... Approximate Distance Oracle with Constant Query Time Zig-zag Sort A Simple Deterministic Data-Oblivious Sorting Algorithm ... Minimum Bisection is Fixed Parameter Tractable IEEE Symposium on Foundations of Computer Science FOCS 2013 https //sites.google.com/site/tcsreading/home/focs2013 The Price of Stability for Undirected Broadcast Network Design with Fair ... Learning Sums of Independent Integer Random Variables OSNAP Faster numerical linear algebra algorithms via sparser subspace ... Efficient Accelerated Coordinate Descent Methods and Faster Algorithms for ... Algebraic Algorithms for b-Matching, Shortest Undirected Paths, and f-Factors Improved approximation for 3-dimensional matching via bounded pathwidth ... Independent Set, Induced Matching, and Pricing Connections and Tight ... Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free ... Online Node-weighted Steiner Forest and Extensions via Disk Paintings An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting ... Approximating Bin Packing within O(log OPT*loglog OPT) bins Strong Backdoors to Bounded Treewidth SAT ACM-SIAM Symposium on Discrete Algorithms SODA 2008 On the Approximability of Influence in Social Networks SODA 2014 Maximizing Social Influence in Nearly Optimal Time Influence Maximization in Undirected Networks International Symposium on Algorithms and Computation ACM Conference on Innovations in Theoretical Computer Science アルゴリズム + ... Workshop on Algorithm Engineering and Experiments ALENEX 2016 Computing Top-k Closeness Centrality Faster in Unweighted Graphs International Symposium on Experimental Algorithms SEA 2015 Is Nearly-linear the Same in Theory and Practice? A Case Study with a ... Workshop on Algorithms and Models for the Web Graph WAW 2012 Dynamic PageRank using Evolving Teleportation SIGMETRICS 2017 Outward Influence and Cascade Size Estimation in Billion-scale Networks ジャーナル版はProceedings of the ACM on Measurement and Analysis of Computing Systems (POMACS) データマイニング + ... ACM SIGKDD Conference on Knowledge Discovery and Data Mining KDD 2001 Mining the Network Value of Customers Co-clustering documents and words using Bipartite Spectral Graph Partitioning KDD 2002 Mining Knowledge-Sharing Sites for Viral Marketing KDD 2007 ✔Cost-effective Outbreak Detection in Networks KDD 2008 ✔Influence and Correlation in Social Networks KDD 2009 Efficient Influence Maximization in Social Networks ✔On Compressing Social Networks KDD 2010 Inferring Networks of Diffusion and Influence Scalable Influence Maximization for Prevalent Viral Marketing in Large-Scale ... Community-based Greedy Algorithm for Mining Top-K Influential Nodes in ... Discovering Frequent Subgraphs over Uncertain Graph Databases under ... Semi-Supervised Feature Selection for Graph Classification KDD 2011 Discovering Highly Reliable Subgraphs in Uncertain Graphs Sparsification of Influence Networks KDD 2012 Streaming Graph Partitioning for Large Distributed Graphs PageRank on an Evolving Graph Information Diffusion and External Influence in Networks Vertex Neighborhoods, Low Conductance Cuts, and Good Seeds for Local ... Information Propagation Game a Tool to Acquire Human Playing Data for ... Chromatic Correlation Clustering Efficient Personalized PageRank with Accuracy Assurance KDD 2013 Denser than the Densest Subgraph Extracting Optimal Quasi-Cliques with ... Redundancy-Aware Maximal Cliques Trial and Error in Influential Social Networks Workshop on Mining and Learning with Graphs (MLG) Polynomial-Time Algorithm for Finding Densest Subgraphs in Uncertain Graphs KDD 2014 Stability of Influence Maximization Minimizing Seed Set Selection with Probabilistic Coverage Guarantee in a ... Heat Kernel Based Community Detection Balanced Graph Edge Partition Correlation Clustering in MapReduce Streaming Submodular Maximization Massive Data Summarization on the Fly Fast Influence-based Coarsening for Large Networks FAST-PPR Scaling Personalized PageRank Estimation for Large Graphs KDD 2015 Influence at Scale Distributed Computation of Complex Contagion in Networks Efficient Algorithms for Public-Private Social Networks Reciprocity in Social Networks with Capacity Constraints Online Influence Maximization Locally Densest Subgraph Discovery ✔Scalable Large Near-Clique Detection in Large-Scale Networks via Sampling Non-exhaustive, Overlapping Clustering via Low-Rank Semidefinite Programming KDD 2016 ✔Robust Influence Maximization (He-Kempe) Robust Influence Maximization (Chen+) FRAUDAR Bounding Graph Fraud in the Face of Camouflage KDD 2018 Approximating the Spectrum of a Graph IEEE International Conference on Data Mining ICDM 2006 Fast Random Walk with Restart and Its Applications ICDM 2010 Scalable Influence Maximization in Social Networks under the Linear ... Modeling Information Diffusion in Implicit Networks ICDM 2011 Simpath An Efficient Algorithm for Influence Maximization under the Linear ... On the Hardness of Graph Anonymization Overlapping correlation clustering Minimizing Seed Set for Viral Marketing ICDM 2012 Reliable Clustering on Uncertain Graphs IRIE Scalable and Robust Influence Maximization in Social Networks Predicting Directed Links using Nondiagonal Matrix Decompositions Inferring the Underlying Structure of Information Cascades Topic-aware Social Influence Propagation Models Time Constrained Influence Maximization in Social Networks Profit Maximization over Social Networks ICDM 2013 Influence Maximization in Dynamic Social Networks UBLF An Upper Bound Based Approach to Discover Influential Nodes in Social ... Influence-based Network-oblivious Community Detection Linear Computation for Independent Social Influence ICDM 2014 Quick Detection of High-degree Entities in Large Directed Networks ICDM 2015 Top-k Reliability Search on Uncertain Graphs ✔Catching the head, tail, and everything in between a streaming algorithm ... ICDM 2017 Importance Sketching of Influence Dynamics in Billion-scale Networks European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases PKDD 2006 Tractable Models for Information Diffusion in Social Networks PKDD 2007 The Most Reliable Subgraph Problem PKDD 2012 On Approximation of Real-World Influence Spread ECML PKDD 2010 Selecting Information Diffusion Models over Social Networks for Behavioral ... ECML PKDD 2012 Influence Spread in Large-Scale Social Networks - A Belief Propagation Approach ECML PKDD 2016 Temporal PageRank SIAM International Conference on Data Mining SDM 2010 Fast Single-Pair SimRank Computation SDM 2011 Influence Maximization in Social Networks When Negative Opinions May Emerge ... Maximising the Quality of Influence SDM 2012 On Influential Node Discovery in Dynamic Social Networks Influence Blocking Maximization in Social Networks under the Competitive ... ✔Fast Robustness Estimation in Large Social Graphs Communities and Anomaly ... SDM 2013 Triadic Measures on Graphs The Power of Wedge Sampling k-means-- A unified approach to clustering and outlier detection Opinion maximization in social networks SDM 2014 Influence Maximization with Viral Product Design Future Influence Ranking of Scientific Literature VoG Summarizing and Understanding Large Graphs Make It or Break It Manipulating Robustness in Large Networks Accelerating Graph Adjacency Matrix Multiplications with Adjacency Forest SDM 2015 Selecting Shortcuts for a Smaller World Where Graph Topology Matters The Robust Subgraph Problem On Influential Nodes Tracking in Dynamic Social Networks ✔Non-exhaustive, Overlapping k-means SDM 2017 A Dual-tree Algorithm for Fast k-means Clustering with Large k Pacific-Asia Conference on Knowledge Discovery and Data Mining PAKDD 2010 Fast Discovery of Reliable k-terminal Subgraphs ソーシャルネットワーク + ... IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining ASONAM 2009 Spectral Counting of Triangles in Power-Law Networks via Element-Wise ... Reducing Social Network Dimensions Using Matrix Factorization Methods Dynamic and Static Influence Models on Starbucks Networks ASONAM 2010 Fast Discovery of Reliable Subnetworks ASONAM 2011 Dynamic Social Influence Analysis through Time-dependent Factor Graphs ASONAM 2012 Influence of the Dynamic Social Network Timeframe Type and Size on the Group ... Diffusion Centrality in Social Networks Visual Analysis of Dynamic Networks using Change Centrality ASONAM 2014 Diversified Social Influence Maximization ASONAM 2015 Structure-Preserving Sparsification of Social Networks ACM Conference on Online Social Networks COSN 2013 Scalable Similarity Estimation in Social Networks Closeness, Node Labels, ... Counting Triangles in Large Graphs using Randomized Matrix Trace Estimation International Conference on Computational Social Networks CSoNet 2015 Real-time Topic-aware Influence Maximization Using Preprocessing Social Influence Spectrum with Guarantees Computing More in Less Time SNA-KDD (International Workshop on Social Network Mining and Analysis) Finding Spread Blockers in Dynamic Networks データベース + ... ACM SIGMOD International Conference on Management of Data SIGMOD 2011 On k-skip Shortest Paths Local Graph Sparsification for Scalable Clustering SIGMOD 2013 Massive Graph Triangulation Efficiently Computing k-Edge Connected Components via Graph Decomposition I/O Efficient Computing SCCs in Massive Graphs TurboISO Towards Ultrafast and Robust Subgraph Isomorphism Search in Large ... TF-Label a Topological-Folding Labeling Scheme for Reachability Querying in ... Online Search of Overlapping Communities Efficient Ad-hoc Search for Personalized PageRank SIGMOD 2014 In Search of Influential Event Organizers in Online Social Networks Efficient Location-Aware Influence Maximization Querying K-Truss Community in Large and Dynamic Graph The Pursuit of a Good Possible World Extracting Representative Instances of ... Influence Maximization Near-Optimal Time Complexity Meets Practical Efficiency SIGMOD 2015 COMMIT A Scalable Approach to Mining Communication Motifs from Dynamic Networks Minimum Spanning Trees in Temporal Graphs Influence Maximization in Near-Linear Time A Martingale Approach SIGMOD 2016 Spheres of Influence for More Effective Viral Marketing ✔Speedup Graph Processing by Graph Ordering Distributed Set Reachability ✔Truss Decomposition of Probabilistic Graphs Semantics and Algorithms Holistic Influence Maximization Combining Scalability and Efficiency with ... Stop-and-Stare Optimal Sampling Algorithms for Viral Marketing in ... TIM+やIMMより高性能（と謳う）影響最大化アルゴリズム SIGMOD 2017 Debunking the Myths of Influence Maximization An In-Depth Benchmarking Study Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling DAG Reduction Fast Answering Reachability Queries Scaling Locally Linear Embedding Dynamic Density Based Clustering IEEE International Conference on Data Engineering ICDE 2010 Finding Top-k Maximal Cliques in an Uncertain Graph ICDE 2011 Outlier Detection in Graph Streams ICDE 2012 Learning Stochastic Models of Information Flow Extracting Analyzing and Visualizing Triangle K-Core Motifs within Networks ICDE 2013 Scalable and Parallelizable Processing of Influence Maximization for ... Scalable Maximum Clique Computation Using MapReduce Faster Random Walks By Rewiring Online Social Networks On-The-Fly Sampling Node Pairs Over Large Graphs ICDE 2014 How to Partition a Billion-Node Graph Random-walk Domination in Large Graphs Evaluating Multi-Way Joins over Discounted Hitting Time Efficient and Accurate Query Evaluation on Uncertain Graphs via Recursive ... International Conference on Very Large Data Bases VLDB 2010 Shortest Path Computation on Air Indexes Fast Incremental and Personalized PageRank k-Nearest Neighbors in Uncertain Graphs VLDB 2011 On Triangulation-based Dense Neighborhood Graph Discovery Distance Constraint Reachability Computation in Uncertain Graphs Efficient Subgraph Search over Large Uncertain Graphs VLDB 2012 Keyword-aware Optimal Route Search gSketch On Query Estimation in Graph Streams A Data-Based Approach to Social Influence Maximization Scalable K-Means++ Fast and Exact Top-k Search for Random Walk with Restart VLDB 2013 iRoad A Framework For Scalable Predictive Query Processing On Road Networks Top-K Nearest Keyword Search on Large Graphs Memory Efficient Minimum Substring Partitioning Piggybacking on Social Networks Streaming Algorithms for k-core Decomposition VLDB 2014 More is Simpler Effectively and Efficiently Assessing Node Pair ... On k-Path Covers and their Applications Crowdsourcing Algorithms for Entity Resolution VLDB 2015 Viral Marketing Meets Social Advertising Ad Allocation with Minimum Regret Online Topic-Aware Influence Maximization Real-time Targeted Influence Maximization for Online Advertisements VLDB 2016 Fast Algorithm for the Lasso based L1-Graph Construction Online Entity Resolution Using an Oracle VLDB 2017 Revenue Maximization in Incentivized Social Advertising Real-Time Influence Maximization on Dynamic Social Streams Revisiting the Stop-and-Stare Algorithms for Influence Maximization ACM International Conference on Information and Knowledge Management CIKM 2008 Mining Social Networks Using Heat Diffusion Processes for Marketing ... The query-flow graph model and applications CIKM 2009 Frequent Subgraph Pattern Mining on Uncertain Graph Data CIKM 2011 Suggesting Ghost Edges for a Smaller World CIKM 2012 Delineating Social Network Data Anonymization via Random Edge Perturbation ✔Gelling, and Melting, Large Graphs by Edge Manipulation CIKM 2013 StaticGreedy Solving the Scalability-Accuracy Dilemma in Influence Maximization Personalized Influence Maximization on Social Networks Probabilistic Solutions of Influence Propagation on Networks Efficiently Anonymizing Social Networks with Reachability Preservation Overlapping Community Detection Using Seed Set Expansion CIKM 2014 Pushing the Envelope in Graph Compression CIKM 2015 Top-k Reliable Edge Colors in Uncertain Graphs International Conference on Extending Database Technology EDBT 2011 Efficient Discovery of Frequent Subgraph Patterns in Uncertain Graph Databases EDBT 2013 CINEMA Conformity-Aware Greedy Algorithm for Influence Maximization in ... EDBT 2014 Online Topic-aware Influence Maximization Queries Privacy Preserving Estimation of Social Influence ✔Fast Reliability Search in Uncertain Graphs EDBT 2015 Identifying Converging Pairs of Nodes on a Budget International Conference on Database Systems for Advanced Applications DASFAA 2011 BMC An Efficient Method to Evaluate Probabilistic Reachability Queries DASFAA 2016 Triangle-Based Representative Possible Worlds of Uncertain Graphs ウェブ + ... International World Wide Web Conference WWW 2003 Extrapolation Methods for Accelerating PageRank Computations WWW 2004 The Effect of the Back Button in a Random Walk Application for PageRank RandomSurfer with Back Step Propagation of Trust and Distrust WWW 2005 BackRank an Alternative for PageRank? WWW 2007 Wherefore Art Thou R3579X? Anonymized Social Networks, Hidden Patterns, and ... WWW 2008 Fast Algorithms for Top-k Personalized PageRank Queries WWW 2009 Towards Context-Aware Search by Learning A Very Large Variable Length Hidden ... WWW 2010 Sampling Community Structure Stochastic Models for Tabbed Browsing Tracking the Random Surfer Empirically Measured Teleportation Parameters in ... WWW 2011 Limiting the Spread of Misinformation in Social Networks Estimating Sizes of Social Networks via Biased Sampling CELF++ Optimizing the Greedy Algorithm for Influence Maximization in Social ... WWW 2012 The Role of Social Networks in Information Diffusion Analyzing Spammer s Social Networks for Fun and Profit Human Wayfinding in Information Networks Optimizing Budget Allocation Among Channels and Influencers Recommendations to Boost Content Spread in Social Networks WWW 2013 Subgraph Frequencies Mapping the Empirical and Extremal Geography of Large ... Estimating Clustering Coefficients and Size of Social Networks via Random Walk Spectral Analysis of Communication Networks Using Dirichlet Eigenvalues WWW 2014 How to Influence People with Partial Incentives An Upper Bound based Greedy Algorithm for Mining Top-k Influential Nodes in ... ポスター Maximizing the Long-term Integral Influence in Social Networks Under the ... ポスター WWW 2015 Path Sampling A Fast and Provable Method for Estimating 4-Vertex Subgraph ... ✔The K-clique Densest Subgraph Problem ASIM A Scalable Algorithm for Influence Maximization under the Independent ... ✔Scalable Methods for Adaptively Seeding a Social Network WWW 2017 Why Do Cascade Sizes Follow a Power-Law? Exact Computation of Influence Spread by Binary Decision Diagrams ACM International Conference on Web Search and Data Mining WSDM 2010 TwitterRank Finding Topic-sensitive Influential Twitterers Learning Influence Probabilities In Social Networks WSDM 2013 On the Streaming Complexity of Computing Local Clustering Coefficients Influence Diffusion Dynamics and Influence Maximization in Social Networks ... From Machu_Picchu to rafting the urubamba river Anticipating information ... WSDM 2015 Negative Link Prediction in Social Media On Integrating Network and Community Discovery The Power of Random Neighbors in Social Networks International Conference on Weblogs and Social Media ICWSM 2010 ICWSM - A Great Catchy Name Semi-Supervised Recognition of Sarcastic ... ICWSM 2011 4chan and /b/ An Analysis of Anonymity and Ephemerality in a Large Online ... 人工知能 + ... AAAI Conference on Artificial Intelligence AAAI 2007 Extracting Influential Nodes for Information Diffusion on a Social Network AAAI 2008 Minimizing the Spread of Contamination by Blocking Links in a Network AAAI 2010 EWLS A New Local Search for Minimum Vertex Cover AAAI 2011 Simulated Annealing Based Influence Maximization in Social Networks Nonnegative Spectral Clustering with Discriminative Regularization AAAI 2012 Exacting Social Events for Tweets Using a Factor Graph Time-Critical Influence Maximization in Social Networks with Time-Delayed ... Two New Local Search Strategies for Minimum Vertex Cover AAAI 2013 Sensitivity of Diffusion Dynamics to Network Uncertainty Spectral Rotation versus K-Means in Spectral Clustering Fast and Exact Top-k Algorithm for PageRank workshop Negative Influence Minimizing by Blocking Nodes in Social Networks AAAI 2014 New Models for Competitive Contagion Influence Maximization with Novelty Decay in Social Networks Rounded Dynamic Programming for Tree-Structured Stochastic Network Design Theory of Cooperation in Complex Social Networks AAAI 2015 Two Weighting Local Search for Minimum Vertex Cover AAAI 2016 Approximate K-Means++ in Sublinear Time AAAI 2018 Risk-Sensitive Submodular Optimization International Joint Conference on Artificial Intelligence IJCAI 2001 Link Analysis, Eigenvectors and Stability IJCAI 2009 Efficient Estimation of Influence Functions for SIS Model on Social Networks IJCAI 2011 Fast Approximate Nearest-Neighbor Search with k-Nearest Neighbor Graph IJCAI 2015 Influence Maximization in Big Networks An Incremental Algorithm for ... Non-monotone Adaptive Submodular Maximization IJCAI 2017 Robust Quadratic Programming for Price Optimization International Conference on Artificial Intelligence and Statistics AISTATS 2012 On Bisubmodular Maximization AISTATS 2018 Random Warping Series A Random Features Method for Time-Series Embedding International Workshop on Internet and Network Economics WINE 2007 Competitive Influence Maximization in Social Networks A Note on Maximizing the Spread of Influence in Social Networks WINE 2010 Threshold Models for Competitive Influence in Social Networks IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology WI-IAT 2009 From Dango to Japanese Cakes Query Reformulation Models and Patterns WI-IAT 2014 Lazy Walks Versus Walks with Backstep Flavor of PageRank Conference on Uncertainty in Artificial Intelligence UAI 2010 Maximizing the Spread of Cascades Using Network Design International Conference on Antonomous Agents and Multiagent Sytems AAMAS 2015 Dynamic Influence Maximization Under Increasing Returns to Scale AAMAS 2016 Robust Influence Maximization (Lowalekar+) KES (International Conference on Knowledge-Based Intelligent Information and Engineering Systems) Prediction of Information Diffusion Probabilities for Independent Cascade Model ISMIS (International Conference on Foundations of Intelligent Systems) Learning Diffusion Probability based on Node Attributes in Social Networks 機械学習 + ... Conference on Neural Information Processing Systems NIPS 2003 Learning with Local and Global Consistency NIPS 2004 An Application of Boosting to Graph Classification NIPS 2009 Random Walks with Random Projections NIPS 2013 http //connpass.com/event/4728/ Scalable Influence Estimation in Continuous-Time Diffusion Networks Distributed Representations of Words and Phrases and their Compositionality DeViSE A Deep Visual-Semantic Embedding Model A Gang of Bandits Similarity Component Analysis One-shot learning by inverting a compositional causal process Inverse Density as an Inverse Problem The Fredholm Equation Approach Approximate Bayesian Image Interpretation using Generative Probabilistic ... Playing Atari with Deep Reinforcement Learning Scalable kernels for graphs with continuous attributes More Effective Distributed ML via a Stale Synchronous Parallel Parameter Server NIPS 2014 Tight Bounds for Influence in Diffusion Networks and Application to Bond ... NIPS 2015 A Structural Smoothing Framework For Robust Graph-Comparison Anytime Influence Bounds and the Explosive Behavior of Continuous-Time ... Learnability of Influence in Networks A Submodular Framework for Graph Comparison https //stanford.edu/~jugander/NetworksNIPS2015/ ワークショップ NIPS 2016 Joint M-Best-Diverse Labelings as a Parametric Submodular Minimization Fast and Provably Good Seedings for k-Means Maximizing Influence in an Ising Network A Mean-Field Optimal Solution Budgeted stream-based active learning via adaptive submodular maximization Computing and maximizing influence in linear threshold and triggering models The Power of Optimization from Samples NIPS 2017 Stochastic Submodular Maximization The Case of Coverage Functions Robust Optimization for Non-Convex Objectives The Importance of Communities for Learning to Influence International Conference on Machine Learning ICML 2003 ✔Marginalized Kernels Between Labeled Graphs ICML 2011 Uncovering the Temporal Dynamics of Diffusion Networks Preserving Personalized Pagerank in Subgraphs ICML 2012 Influence Maximization in Continuous Time Diffusion Networks ICML 2014 Efficient Label Propagation ICML 2015 ✔Yinyang K-Means A Drop-In Replacement of the Classic K-Means with ... ACML (Asian Conference on Machine Learning) 2009 Learning Continuous-Time Information Diffusion Model for Social Behavioral ... 高性能計算 + ... IEEE International Parallel & Distributed Processing Symposium IPDPS 2016 Rabbit Order Just-in-time Parallel Reordering for Fast Graph Analysis PDPTA (International Conference on Parallel and Distributed Processing Techniques and Applications) Latent Feature Independent Cascade Model for Social Propagation 通信ネットワーク + ... IEEE International Conference on Computer Communications INFOCOM 2007 On a Routing Problem Within Probabilistic Graphs ... INFOCOM 2012 Approximate Convex Decomposition Based Localization in Wireless Sensor Networks INFOCOM 2013 2.5K-Graphs from Sampling to Generation Maximizing Submodular Set Function with Connectivity Constraint Theory and ... A Graph Minor Perspective to Network Coding Connecting Algebraic Coding ... INFOCOM 2014 Information Diffusion in Mobile Social Networks The Speed Perspective A General Framework of Hybrid Graph Sampling for Complex Network Analysis INFOCOM 2015 Assessing Attack Vulnerability in Networks with Uncertainty INFOCOM 2016 Cost-aware Targeted Viral Marketing in Billion-scale Networks INFOCOM 2017 Why approximate when you can get the exact? Optimal Targeted Viral Marketing ... WASA (Wireless Algorithms, Systems, and Applications) Minimum-Cost Information Dissemination in Social Networks 情報検索 + ... ACM International Conference on Research and Development in Information Retrieval SIGIR 2014 The Role of Network Distance in LinkedIn People Search Influential Nodes Selection A Data Reconstruction Perspective IMRank Influence Maximization via Finding Self-Consistent Ranking 自然言語処理 + ... Meeting of the Association for Computational Linguistics ACL 2011 Word Alignment via Submodular Maximization over Matroids ACL 2013 A user-centric model of voting intention from Social Media グラフィクス・ビジョン・HCI + ... ACM SIGCHI Conference on Human Factors in Computing Systems IEEE Conference on Computer Vision and Pattern Recognition CVPR 2014 Spectral Graph Reduction for Efficient Image and Streaming Video Segmentation superpixelでグラフを小さくして画像分割とかを効率化 SBP (International Workshop on Social Computing and Behavioral Modeling) 2009 Finding Influential Nodes in a Social Network from Information Diffusion Data Manuscript+Technical report Random-walk domination in large graphs problem definitions and fast solutions Lazier Than Lazy Greedy ✔A Fast and Provable Method for Estimating Clique Counts Using Turan s Theorem ジャーナル トップジャーナル KAIS (Knowledge and Information Systems) Efficient algorithms for influence maximization in social networks IPL (Information Processing Letters) A Fast and Practical Bit-Vector Algorithm for the Longest Common Subsequence ... Internet Mathematics Link Evolution Analysis and Algorithms Towards Scaling Fully Personalized PageRank Algorithms, Lower Bounds, and ... TKDD (Transactions on Knowledge Discovery from Data) 2009 Blocking Links to Minimize Contamination Spread in a Social Network TKDE 2013 Clustering Large Probabilistic Graphs 普通のジャーナル Computational Social Networks Efficient influence spread estimation for influence maximization under the ... Computers and Mathematics with Applications A practical bounding algorithm for computing two-terminal reliability based ... Dynamics of Information Systems Algorithmic Approaches Minimum-Risk Maximum Clique Problem Information Sciences Super mediator - A new centrality measure of node importance for information ... Minimizing the expected complete influence time of a social network Maximizing the spread of influence ranking in social networks 連続時間マルコフ連鎖を取り入れたICモデル JCO (Journal of Combinatorial Optimization) 2012 The complexity of influence maximization problem in the deterministic linear ... JSAC (IEEE Journal on Selected Areas in Communications) 2013 On Budgeted Influence Maximization in Social Networks SNAM (Social Network Analysis and Mining) 2012 On minimizing budget and time in influence propagation over social networks TPDS (IEEE Transactions on Parallel and Distributed Systems) IMGPU GPU-Accelerated Influence Maximization in Large-Scale Social Networks フォーカス外 Maximizing the Extent of Spread in a Dynamic Network ICEC (International Conference on Electronic Commerce) Maximizing Influence in a Competitive Social Network A Follower s Perspective WISE 2013 A Novel and Model Independent Approach for Efficient Influence Maximization ... 国内会議 人工知能学会 JSAI Resampling-based Predictive Simulation for Identifying Influential Nodes ... Finding Important Users for Information Diffusion Influence analysis of information diffusion focusing on directed networks Proposal of AIDM Agent-based Information Diffusion Model Predicting Japanese General Election in 2013 with Twitter Considering ... Which Targets to Contact First to Maximize Influence over Social Network 他分野 Econometrica The Network Origins of Aggregate Fluctuations PLoS ONE Social Network Sensors for Early Detection of Contagious Outbreaks Proceedings of the National Academy of Sciences PNAS Dynamic social networks promote cooperation in experiments with humans Spectral Redemption Clustering Sparse Networks Physical Review Letters First Passage Time for Random Walks in Heterogeneous Networks Adaptation and Optimization of Biological Transport Networks Locating the Source of Diffusion in Large-Scale Network Enhanced Flow in Small-World Networks Science Quantifying Long-Term Scientific Impact Control Profiles of Complex Networks Nature Communications Griffiths phases and the stretching of criticality in brain networks A scaling law for random walks on networks Influence maximization in complex networks through optimal percolation 2024-04-23 23 09 41 (Tue)
https://w.atwiki.jp/freememo/pages/56.html
HINTERNET g_hInet; HINTERNET g_hURL; //===========================================================================// /*! @brief WinInetライブラリ初期処理 @param[in] lpszURL 対象URL @return 成否 */ //===========================================================================// BOOL InitWinInet(LPCTSTR lpszURL) { // WinInetライブラリ開始 g_hInet = InternetOpen( L"", INTERNET_OPEN_TYPE_PRECONFIG, NULL, NULL, 0); if (g_hInet == NULL) { return FALSE; } // セッションオープン g_hURL = InternetOpenUrl(g_hInet, lpszURL, NULL, 0, 0, 0); if (g_hURL == NULL) { return FALSE; } return TRUE; } //===========================================================================// /*! @brief WinInetライブラリ終了処理 @return 無し */ //===========================================================================// void TerminateWinInet() { // WinInet関連ハンドル開放 if (g_hURL) { InternetCloseHandle(g_hURL); } if (g_hInet) { InternetCloseHandle(g_hInet); } } //===========================================================================// /*! @brief HTTPヘッダー情報取得 @param[in] lpszURL 対象URL @param[out] lpOutBuffer HTTPヘッダー情報バッファ @param[in/out] hMem メモリハンドル @return 成否 */ //===========================================================================// BOOL WINAPI NMAPI_GetHttpSource(LPCTSTR lpszURL, LPSTR lpOutBuffer, HGLOBAL hMem) { BOOL bRet = FALSE; // WinInetライブラリ初期処理 if (! InitWinInet(lpszURL)) { goto END; } // データ読み出し // サイトによっては、文字コードに左右される可能性がある為、マルチバイト扱いとする CHAR szBuf[128]; ZeroMemory(szBuf, sizeof(szBuf)); DWORD dwRead; int nTotal = 0; while (TRUE) { InternetReadFile(g_hURL, szBuf, (DWORD)sizeof(szBuf) - 1, dwRead); szBuf[dwRead] = \0 ; if (dwRead == 0) { break; } nTotal += dwRead; // メモリ再割り当て hMem = GlobalReAlloc(hMem, (SIZE_T)nTotal+1, GMEM_MOVEABLE); if (hMem == NULL) { goto END; } lpOutBuffer = (CHAR *)GlobalLock(hMem); if (lpOutBuffer == NULL) { goto END; } strcat_s(lpOutBuffer, nTotal+1, szBuf); } bRet = TRUE; END // WinInetライブラリ終了処理 TerminateWinInet(); return bRet; } //===========================================================================// //呼び出し側 //===========================================================================// { // メモリ割り当て HGLOBAL hMem = GlobalAlloc(GHND, sizeof(TCHAR)); TCHAR* lpszHeader = (TCHAR*)GlobalLock(hMem); if (NMAPI_GetHttpHeader(strURL, lpszHeader, hMem)) { ・・・ ・・・ ・・・ } // メモリ開放 GlobalUnlock(hMem); GlobalFree(hMem); }